Theorem mtord 773

Description: A modus tollens deduction involving disjunction. (Contributed by Jeff Hankins, 15-Jul-2009.) (Revised by Mario Carneiro, 31-Jan-2015.)

Hypotheses

Ref	Expression
mtord.1	⊢ (𝜑 → ¬ 𝜒)
mtord.2	⊢ (𝜑 → ¬ 𝜃)
mtord.3	⊢ (𝜑 → (𝜓 → (𝜒 ∨ 𝜃)))

Assertion

Ref	Expression
mtord	⊢ (𝜑 → ¬ 𝜓)

Proof of Theorem mtord

Step	Hyp	Ref	Expression
1		mtord.3	. . 3 ⊢ (𝜑 → (𝜓 → (𝜒 ∨ 𝜃)))
2		mtord.1	. . . . 5 ⊢ (𝜑 → ¬ 𝜒)
3	2	pm2.21d 609	. . . 4 ⊢ (𝜑 → (𝜒 → ¬ 𝜓))
4		mtord.2	. . . . 5 ⊢ (𝜑 → ¬ 𝜃)
5	4	pm2.21d 609	. . . 4 ⊢ (𝜑 → (𝜃 → ¬ 𝜓))
6	3, 5	jaod 707	. . 3 ⊢ (𝜑 → ((𝜒 ∨ 𝜃) → ¬ 𝜓))
7	1, 6	syld 45	. 2 ⊢ (𝜑 → (𝜓 → ¬ 𝜓))
8	7	pm2.01d 608	1 ⊢ (𝜑 → ¬ 𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 698

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699

This theorem depends on definitions:  df-bi 116

This theorem is referenced by:  swoer  6529