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

Theorem pm2.01d 105
Description: Deduction based on reductio ad absurdum.
Hypothesis
Ref Expression
pm2.01d.1 |- (ph -> (ps -> -. ps))
Assertion
Ref Expression
pm2.01d |- (ph -> -. ps)

Proof of Theorem pm2.01d
StepHypRef Expression
1 pm2.01d.1 . 2 |- (ph -> (ps -> -. ps))
2 pm2.01 104 . 2 |- ((ps -> -. ps) -> -. ps)
31, 2syl 12 1 |- (ph -> -. ps)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3
This theorem is referenced by:  pclem6 813  efrirr 3637  oalimcl 5242  omlimcl 5257  ivthlem7 8549  cvnref 11863  untelirr 13796  dfon2lem4 13852  dford4lem2 13860  amosym1 14250  top2usne 14898
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
Copyright terms: Public domain