Department Of Computer Science, CUI
Lahore Campus
CSC102 - Discrete Structures
By
Mahwish Waqas
10/26/2022 CSC102 - Discrete Structures 2
Lecture Outline
• Rules of Inference
• Rules of inference with quantifiers
• Proof using rules of Inference
10/26/2022 CSC102 - Discrete Structures 3
Rules of Inference for the Universal Quantifier
• Assume that we know that x P(x) is true
• Then we can conclude that P(c) is true
• Here c is particular value in domain
• This is called “universal instantiation”
• Example: All women are wise therefore Lisa is wise.
• Assume that we know that P(c) is true for all value of c in
domain
• Then we can conclude that x P(x) is true
• This is called “universal generalization”
• Example: Student s has taken calculus therefore All students has
taken calculus.
10/26/2022 CSC102 - Discrete Structures 4
Rules of Inference for the Existential Quantifier
• Assume that we know that x P(x) is true
• Then we can conclude that P(c) is true for some value of c
• This is called “existential instantiation”.
• Example: There is a fish in a pool therefore Some fish a is in pool.
• Assume that we know that P(c) is true for some value of c
• Then we can conclude that x P(x) is true
• This is called “existential generalization”.
• Example: Ali is in the store therefore There is a person in store.
10/26/2022 CSC102 - Discrete Structures 5
Rules of Inference for Quantified Statements
Rule of Inference Name
∀xP(x)
Universal instantiation
∴ P(c)
P(c) for an arbitrary c
Universal generalization
∴ ∀xP(x)
∃xP(x)
Existential instantiation
∴ P(c) for some element c
P(c) for some element c
Existential generalization
∴ ∃xP(x)
10/26/2022 CSC102 - Discrete Structures 6
x( D( x) → C ( x))
Example D( Ali )
C ( Ali )
• Given the hypothesis:
“Everyone in this discrete mathematics class has taken a
course in computer science” and “Ali is in this discrete
mathematics class” imply the conclusion “Ali has taken a
course in computer science.”
• Let D(x) = “x is in this discrete mathematics class,”
• Let C(x) = “x has taken a course in computer science.”
• The hypothesis are ∀x(D(x) → C(x)) and D(Ali).
• The conclusion is C(Ali).
10/26/2022 CSC102 - Discrete Structures 7
x( D( x) → C ( x))
Example D( Ali )
C ( Ali )
• The following steps can be used to establish the
conclusion from the hypothesis.
• Step Reason
1. ∀x(D(x) → C(x)) Hypothesis
2. D(Ali)→C(Ali) Universal instantiation from 1
3. D(Ali) Hypothesis
4. C(Ali) Modus ponens from 2 and 3
10/26/2022 CSC102 - Discrete Structures 8
Example
• Given the hypothesis
“A student in this class has not read the book,” and “Everyone in this
class passed the first exam” imply the conclusion “Someone who
passed the first exam has not read the book.”
• Let C(x) = “x is student in this class,” x(C ( x) B( x))
• Let B(x) = “x has read the book,” x(C ( x) → P( x))
• Let P(x) = “x passed the first exam.”
x( P ( x) B ( x))
• The hypothesis are ∃x(C(x)∧￢B(x)) and ∀x(C(x) → P(x)).
• The conclusion is ∃x(P(x)∧￢B(x)).
10/26/2022 CSC102 - Discrete Structures 9
x(C ( x) B( x))
Example Proof x(C ( x) → P( x))
x( P ( x) B ( x))
1. ∃x(C(x)∧￢B(x)) Hypothesis
2. C(a)∧￢B(a) Existential instantiation from 1
3. C(a) Simplification from 2
4. ∀x(C(x) → P(x)) Hypothesis
5. C(a) → P(a) Universal instantiation from 4
6. P(a) Modus ponens from 3 and 5
7. ￢B(a) Simplification from 2
8. P(a)∧￢B(a) Conjunction from 6 and 7
9. ∃x(P(x)∧￢B(x)) Existential generalization from 8
10/26/2022 CSC102 - Discrete Structures 10
Universal Modus Ponens
• If x(P(x) →Q(x)) is true, and if P(a) is true for a particular
element ‘a’ in the domain of the universal quantifier, then
Q(a) must also be true.
x(P(x) →Q(x))
P(a), where a is a particular element in the domain
Q(a)
10/26/2022 CSC102 - Discrete Structures 11
Universal Modus Tollens
• If x(P(x) →Q(x)) is true, and if Q(a) is false for a
particular element ‘a’ in the domain of the universal
quantifier, then P(a) must also be false.
x(P(x) →Q(x))
¬Q(a), where a is a particular element in the domain
¬P(a)
10/26/2022 CSC102 - Discrete Structures 12
Example of Proof
• Given the hypotheses:
• “Maria is a student in this class, owns a red convertible.”
• “Everybody who owns a red convertible has gotten a speeding
ticket”
• Can you conclude: “Somebody in this class has gotten a speeding
ticket”?
• Let C(x) = “x is student in this class”.
• Let R(x) = “x has owns a red convertible”.
• Let T(x) = “x has gotten speeding ticket”.
• The hypothesis are x (R(x)→T(x)), C(Maria) and R(Maria).
• The conclusion is x (C(x)T(x)).
10/26/2022 CSC102 - Discrete Structures 13
Example of Proof
1. x (R(x)→T(x)) Hypothesis
2. R(Maria) → T(Maria) Universal instantiation using 1
3. R(Maria) Hypothesis
4. T(Maria) Modes ponens using 2 and 3
5. C(Maria) Hypothesis
6. C(Maria) T(Maria) Conjunction using 5 and 4
7. x (C(x)T(x)) Existential generalization using 6
10/26/2022 CSC102 - Discrete Structures 14
How do you know which one to use?
• Experience!
• In general, use quantifiers with statements like “for all” or
“there exists”
10/26/2022 CSC102 - Discrete Structures 15
Chapter Reading
• Chapter 1, Kenneth H. Rosen, Discrete Mathematics and
Its Applications, Section 1.6
10/26/2022 CSC102 - Discrete Structures 16
Exercise Questions
Q – 1, 2, 3, 4, 5, 6,13-b,13-d, 23, 24
