Theorem mtbii 685

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 158	. 2 |- ( ph -> ( ch -> ps ) )
4	1, 3	mtoi 674	1 |- ( ph -> -. ch )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   <-> wb 105

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624

This proof depends on definitions:  df-bi 117

This theorem is used by:  onsucelsucexmid  4679  nntri2  6772  nntri3  6775  nndceq  6777  inffiexmid  7219  genpdisj  7896  ltposr  8136  hashennn  11240  fsumsplit  12198  sumsplitdc  12223  fprodm1  12389  m1dvdsndvds  13055  ballotfilemi1  13302  ballotfilemii  13303  chtqub  16313