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

Theorem condan 478
Description: Proof by contradiction.
Hypotheses
Ref Expression
condan.1 |- ((ph /\ -. ps) -> ch)
condan.2 |- ((ph /\ -. ps) -> -. ch)
Assertion
Ref Expression
condan |- (ph -> ps)

Proof of Theorem condan
StepHypRef Expression
1 condan.1 . . . 4 |- ((ph /\ -. ps) -> ch)
21ex 373 . . 3 |- (ph -> (-. ps -> ch))
3 condan.2 . . . 4 |- ((ph /\ -. ps) -> -. ch)
43ex 373 . . 3 |- (ph -> (-. ps -> -. ch))
52, 4pm2.65d 136 . 2 |- (ph -> -. -. ps)
6 nega 84 . 2 |- (-. -. ps -> ps)
75, 6syl 10 1 |- (ph -> ps)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   /\ wa 223
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 147  df-an 225
Copyright terms: Public domain