Theorem mtbid 291

Description: A deduction from a biconditional, similar to modus tollens. (Contributed by NM, 26-Nov-1995.)

Hypotheses

Ref	Expression
mtbid.min	|- (ph -> -. ps)
mtbid.maj	|- (ph -> (ps <-> ch))

Assertion

Ref	Expression
mtbid	|- (ph -> -. ch)

Proof of Theorem mtbid

Step	Hyp	Ref	Expression
1		mtbid.min	. 2 |- (ph -> -. ps)
2		mtbid.maj	. . 3 |- (ph -> (ps <-> ch))
3	2	biimprd 214	. 2 |- (ph -> (ch -> ps))
4	1, 3	mtod 168	1 |- (ph -> -. ch)

Syntax hints:  -. wn 3   -> wi 4   <-> wb 176

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 177

This theorem is referenced by:  sylnib  295  eqneltrrd  2447  neleqtrd  2448  eueq3  3012  nnadjoinpw  4522  nnc3n3p2  6280