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

Theorem pm2.01d 81
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 80 . 2 |- ((ps -> -. ps) -> -. ps)
31, 2syl 12 1 |- (ph -> -. ps)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2
This theorem is referenced by:  pclem6 555  efrirr 2180  oalimcl 3162  cvnreft 5723
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
metamath.org