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

Theorem mt3i 100
Description: Modus tollens inference.
Hypotheses
Ref Expression
mt3i.1 |- -. ch
mt3i.2 |- (ph -> (-. ps -> ch))
Assertion
Ref Expression
mt3i |- (ph -> ps)

Proof of Theorem mt3i
StepHypRef Expression
1 mt3i.1 . 2 |- -. ch
2 mt3i.2 . . 3 |- (ph -> (-. ps -> ch))
32con1d 85 . 2 |- (ph -> (-. ch -> ps))
41, 3mpi 44 1 |- (ph -> ps)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2
This theorem is referenced by:  a16g 933  ordeleqon 2241  limom 2387  zornlem4 3606  inelr 4527  crulem 4528
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
metamath.org