Theorem mtbii 663

Description: An inference from a biconditional, similar to modus tollens. (Contributed by NM, 27-Nov-1995.)

Hypotheses

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

Assertion

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

Proof of Theorem mtbii

Step	Hyp	Ref	Expression
1		mtbii.min	. 2 |- -. ps
2		mtbii.maj	. . 3 |- ( ph -> ( ps <-> ch ) )
3	2	biimprd 157	. 2 |- ( ph -> ( ch -> ps ) )
4	1, 3	mtoi 653	1 |- ( ph -> -. ch )

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

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 603  ax-in2 604

This theorem depends on definitions:  df-bi 116

This theorem is referenced by:  onsucelsucexmid  4445  nntri2  6390  nntri3  6393  nndceq  6395  inffiexmid  6800  genpdisj  7331  ltposr  7571  hashennn  10526  fsumsplit  11176  sumsplitdc  11201