Scribd
Upload
7 views4 pages

Homework 4

Uploaded by

bmharter
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views4 pages

Homework 4

Uploaded by

bmharter
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Homework 4

Benjamin Harter
April 2024

1 Velleman 3.2 Problems 1-6


1. (a) Suppose P → Q and Q → R are both true. Prove that P → R is
true.
(i) P →Q (premise)
(ii) Q→R (premise)
(iii) P (premise)
(iv) Q (modus ponens of i and iii)
(v) R (modus ponens of ii and iv)
(vi) P →R (disjunctive syllogism of iv and v)
(b) Suppose ¬R → (P → ¬Q). Prove that P → (Q → R).
(i) ¬R → (P → ¬Q) (premise)
(ii) ¬(P → ¬Q) (premise)
(iii) ¬¬R. (modus tollens of i and ii)
(iv) R (law of double negation)
(v) ¬(P → ¬Q) → R (disjunctive syllogism of ii and iv)
(vi) (P → ¬Q) ∨ R (conditional law)
(vii) (¬P ∨ ¬Q) ∨ R (conditional law)
(viii) ¬P ∨ (¬Q ∨ R) (associative law)
(ix) ¬P ∨ (Q → R) (conditional law)
(x) P → (Q → R) (conditional law)
2. (a) Suppose P → Q and R → ¬Q are both true. Prove that P → ¬R is
true.
(i) P →Q (premise)
(ii) R → ¬Q (premise)
(iii) P (premise)
(iv) Q (modus ponens of ii and iii)
(v) ¬R (modus tolens of i and iv)
(vi) P → ¬R (modus ponens of iii, iv, and v)

1
(b) Suppose that P is true. Prove that Q → ¬(Q → ¬P ) is true.
(i) Q → ¬(Q → ¬P ) (premise)
(ii) P (premise)
(iii) ¬Q ∨ ¬(Q → ¬P ) (conditional law)
(iv) ¬Q ∨ ¬(¬Q ∨ ¬P ) (conditional law)
(v) ¬Q ∨ (Q ∧ P ) (De Morgan’s law)
(vi) (Q ∨ ¬Q) ∧ (P ∨ ¬Q) (distributive law)
(vii) T ∧ (P ∨ ¬Q) (tautology)
(viii) P ∨ ¬Q (tautology law)
(ix) T ∨ ¬Q (equivalent according to ii)
(x) T (tautology law)
3. Suppose A ⊆ C, and B and C are disjoint. Prove that if x ∈ A, then
x∈/ B.
(i) A ⊆ C (premise)
(ii) B ∩ C ≡ Ø (premise)
(iii) x ∈ A → x ∈ C (definition of i)
(iv) x ∈ C → x ∈
/B (definition of ii)
(v) x ∈ A → x ∈
/B (disjunctive syllogism of iii and iv)
4. Suppose that A \ B is disjoint from C and x ∈ A. Prove that if x ∈ C
then x ∈ B.

(i) ((A \ B) ∩ C) ≡ Ø (premise)


(ii) x ∈ A (premise)
(iii) x ∈ A ∧ x ∈
/ B∧x∈C →x≡Ø (implied by i)
(iv) T ∧ x ∈
/ B∧x∈C →x≡Ø (implied by ii)
(v) x ∈
/ B∧x∈C →x≡Ø (tautology law)
(vi) ¬(x ∈
/ B ∧ x ∈ C) ∨ x ≡ Ø (conditional law)
(vii) (x ∈ B ∨ x ∈
/ C) ∨ x ≡ Ø (De Morgan’s law)
(viii) x ∈ B ∨ x ∈
/ C ∨x≡Ø (associative law)
(ix) x ∈ B ∨ x ∈
/ C ∨F (contradiction)
(x) x ∈ B ∨ x ∈
/C (contradiction law)
(xi) x ∈
/ C ∨x∈B (commutative law)
(xii) x ∈ C → x ∈ B (conditional law)
5. Use the method of proof by contradiction to prove that, given A ∩ C ⊆ B
and x ∈ C, x ∈
/ A \ B.

(i) A ∩ C ⊆ B (premise)

2
(ii) (x ∈ A ∧ x ∈ C) → x ∈ B (implied by i)
(iii) x ∈ C (premise)
(iv) x ∈ A \ B (premise to disprove)
(v) x ∈ A ∧ x ∈
/B (implied by iv)
(vi) x ∈ A (decomposition of conjuntion)
(vii) x ∈
/B (decomposition of conjuntion)
(viii) x ∈
/C (modus tolens of ii, vi, and vii)
(ix) x ∈ C ∧ x ∈
/C (conjunction of iii and viii, a contradiction)

To ensure the contradiction is due to iv, we will suppose the negation of


that premise instead and check for contradictions:

(iv) x ∈
/ A\B (premise)
(v) x ∈
/ A ∨ (x ∈ A ∧ x ∈ B) (implied by iv)
(vi) (x ∈ A ∨ x ∈
/ A) ∧ (x ∈
/ A ∨ x ∈ B) (distributive law)
(vii) T ∧ (x ∈
/ A ∨ x ∈ B) (tautology)
(viii) x ∈
/ A∨x∈B (tautology law)
(ix) x ∈ A → x ∈ B (conditional law)
(x) A ⊆ B (implied by ix)

The last statement is not a contradiction of i, since if A ⊆ B, A ∩ C ⊆ B


would be automatically true. We can also check x ∈ / A \ B directly:

(iv) ¬(x ∈ A ∧ x ∈ C) ∨ x ∈ B (conditional law applied to ii)


(v) (x ∈
/ A∨x∈
/ C) ∨ x ∈ B (De Morgan’s law)
(vi) x ∈
/ A∨x∈
/ C ∨x∈B (associative law)
(vii) x ∈
/ A∨x∈B∨x∈
/C (commutative law)
(viii) ¬(x ∈
/ A ∨ x ∈ B) → x ∈
/C (conditional law)
(ix) (x ∈ A ∧ x ∈
/ B) → x ∈
/C (De Morgan’s Law)
(x) x ∈ A \ B → x ∈
/C (implied by ix)
(xi) x ∈
/ A\B (modus tolens of iii and x)

6. Use the method of proof by contradiction to prove that, given A ⊆ B,


x ∈ A, and x ∈
/ A \ B, x ∈ C is true.

(i) A ⊆ B (premise)
(ii) x ∈ A (premise)
(iii) x ∈
/ B\C (premise)
(iv) x ∈
/C (premise to disprove)

3
(v) x ∈ A → x ∈ B (implied by i)
(vi) x ∈ B (modus ponens of ii and v)
(vii) ¬(x ∈ B ∧ x ∈
/ C) (implied by iii)
(viii) x ∈
/ B∨x∈C (De Morgan’s law)
(ix) x ∈ B → x ∈ C (conditional law)
(x) x ∈
/B (modus tolens of iv and viii)
(xi) x ∈ B ∧ x ∈
/B (conjunction of vi and x, a contradiction)

2 Attached Problem
Show that ¬¬P ↔ P is true by using proof by contradiction.

(i) Assume ¬(¬¬P ↔ P ) (premise)


(ii) (¬¬¬P ∧ P ) ∨ (¬¬P ∧ ¬P ) (implied by i)
(iii) (¬¬¬P ∧ P ) ∨ F (contradiction)
(iv) ¬¬¬P ∧ P (contradiction law)

(v) ¬P ∧ P (double negation law, a contradiction)

You might also like