Suppose . P ( x)∧Q( x ) are prediction for x∈ some domain.

Consider the following propositions :

A . ∀ x ( P ( X ) ⋀ Q ( X ) )=∀ xP( X ) ⋀ ∀ xQ( X )¿

¿ Always True .
PROOF : Let P ( x ) ⋀ Q ( x )=R ( x ) ∀ x ∈ D o

So ∀ x ∈ Do P( x)

∀ x ∈ D o Q( x )

x D P ( x ) is true , P( x )is true for every x∈D

R ( x )=∀ x ∈ D 0 P( x )⋀ ∀ x ∈ D 0 Q(x)

¿ ∀ xP(x) ⋀ ∀ xQ(x )

a. 1. ∀ x ( P ( X ) ⋀ Q ( X ) )=∀ xP( X ) ⋀ ∀ xQ( X )¿ Distributive Law

2. ∀ xP ( x ) Q ( x) TRUE

3. ∀ xP (x) ⋀ ∀ xQ( x) TRUE

4. P( x ) ⋀ Q( x) TRUE

5.[¿

1. • Exercise:A = (x : 3 < x), 8 = {x : x <O}, C = A n B. Prove that C = 0 • What does it mean C = 07

-3x(x E C)

1. ∀ xP ( x ) Q(x) Hypothesis for the sake of distributive law

2. d ∈ P,Q Existential instantiation, 1

3. d∈A∩B Definition of C, 2

4. dEAAdEB Definition of A, 3

5. d E A Simplification, 4

6. d E 8 Simplification, 4

7. 3 < d Definition of A

8. d <0 Definition of B

9. 3 < 0 Existential generalization, 7, 8, transitivity of <

10. False 9

11. 3x(x E C) -• False Hypothesis elimination, 1, 10

12. -3x(x E C) V False Conditional Identity, 11 13. -3x(x E C) Identity Law, 12

B . ∀ x ( P ( X ) ⋁ Q ( X ) )=∀ xP( X )⋁ ∀ xQ( X ) ¿

¿ Not always true .

PROOF : P ( X )=X is even
Q ( x ) =X is odd
x∈Z
P ( x ) ∨Q(x )
¿ x is even on x isodd
∀ x( P ( x ) ⋁ Q ( x ))
¿ For all x ∈ Z , x is even∨x is odd
Z is the set of integers :as domain for bothof them
But ∀ xP ( x ) ⋁ ∀ xQ( x)
¿ For x ∈ Z , x is odd∨for x ∈ Z x is even .
Neither all x ∈ Z are odd or even.

b.1. ∀ x ( P ( X ) ⋁ Q ( X ) )=∀ xP( X )⋁ ∀ xQ( X )¿ Distributive Law

2. ∀ x ( P ( X ) ⋁ Q ( X ) ) Not always True

P ( X )= X is even Q ( x )=X is odd

3. ∀ xP (X ) ⋁ ∀ xQ (X ) Not always True

4. P( x ) ⋀ Q( x) Not always True

5.[( ∀ x ( P ( X ) ⋁ Q ( X ) )=∀ xP( X)⋁ ∀ xQ( X))]

C . ∃ x ( P ( x ) ∧Q ( x ) ) =∃ xP(x )∧ ∃ xQ(x)
¿ Always true
PROOF :∃ x ¿ )
¿ For some x E P ( x ) ∧Q ( x )=R(x)
x D , P ( x ) istrue , P( x )is true for at least one x ∈D
 So R ( x ) x ∈ E
R ( x )=x ∈ E P ( x ) ∧ x ∈ E Q( x )
=∃ xP( x)∧ ∃ xQ(x )

C From 1: P(a) ∧ Q(a) (2) − Existential Instantiation

2: P(a) (3)

2: Q(a) (4)

3: ∃xP(x) (5) − Existential Generalization of (3)

4: ∃xQ(x) (6) − Existential Generalization of (4)

3, 4: ∃xP(x) ∧ ∃xQ(x) QED

D .∃ x ( P ( x ) ∨Q ( x ) )=∃ xP (x) ∨∃ xQ(x )

¿ Always True
PROOF : ∃ x ( P ( x ) ∨Q ( x ))
¿ For some x ∈ E P ( x ) ∨Q ( x )=S( x )
So S (x) has a domain T which includes some x ∈ ∃
S ( x )=x ∈ T P ( x ) ∨ x ∈ T Q(x)
¿ x ∈ E P (x) ⋁ x ∈ E Q(x)
¿ ∃ x P ( x)⋁ ∃ xQ ( x)
D From 1: P(a) ⋁ Q(a) (2) − Existential Instantiation

2: P(a) (3)

2: Q(a) (4)

3: ∃xP(x) (5) − Existential Generalization of (3)

4: ∃xQ(x) (6) − Existential Generalization of (4)

3, 4: ∃xP(x) ⋁ ∃xQ(x) QED

For each of the above statements ,determine if it is always true . If the statement is always true , provide a
formal proof ( valid argument approach ) . If the statement is not always true , give amexample of
P ( x ) , Q ( x )∧a domain where it is false . We recommend you ¿ seethe set of integer numbers as the
domain discourse ,“ P( x)=x is even ”∧“ Q(x)=x is odd ” for counter examples .