Theorem mtord 697

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 549	. . . 4 ⊢ (𝜑 → (𝜒 → ¬ 𝜓))
4		mtord.2	. . . . 5 ⊢ (𝜑 → ¬ 𝜃)
5	4	pm2.21d 549	. . . 4 ⊢ (𝜑 → (𝜃 → ¬ 𝜓))
6	3, 5	jaod 637	. . 3 ⊢ (𝜑 → ((𝜒 ∨ 𝜃) → ¬ 𝜓))
7	1, 6	syld 40	. 2 ⊢ (𝜑 → (𝜓 → ¬ 𝜓))
8	7	pm2.01d 548	1 ⊢ (𝜑 → ¬ 𝜓)

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

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630

This theorem depends on definitions:  df-bi 110

This theorem is referenced by:  swoer  6134