HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem mt4d 115
Description: Modus tollens deduction.
Hypotheses
Ref Expression
mt4d.1 |- (ph -> ps)
mt4d.2 |- (ph -> (-. ch -> -. ps))
Assertion
Ref Expression
mt4d |- (ph -> ch)

Proof of Theorem mt4d
StepHypRef Expression
1 mt4d.1 . 2 |- (ph -> ps)
2 mt4d.2 . . 3 |- (ph -> (-. ch -> -. ps))
32a3d 75 . 2 |- (ph -> (ps -> ch))
41, 3mpd 26 1 |- (ph -> ch)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3
This theorem is referenced by:  atom1d 10217
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
Copyright terms: Public domain