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

Theorem mtt 534
Description: Modus-tollens-like theorem.
Assertion
Ref Expression
mtt |- (-. ph -> (-. ps <-> (ps -> ph)))

Proof of Theorem mtt
StepHypRef Expression
1 pm2.21 71 . . 3 |- (-. ps -> (ps -> ph))
21a1i 7 . 2 |- (-. ph -> (-. ps -> (ps -> ph)))
3 con3 86 . . 3 |- ((ps -> ph) -> (-. ph -> -. ps))
43com12 13 . 2 |- (-. ph -> ((ps -> ph) -> -. ps))
52, 4impbid 397 1 |- (-. ph -> (-. ps <-> (ps -> ph)))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   <-> wb 127
This theorem is referenced by:  axpowndlem3 3745  axpownd 3747  large 5700
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-an 198
metamath.org