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

Theorem ecase3 752
Description: Inference for elimination by cases.
Hypotheses
Ref Expression
ecase3.1 |- (ph -> ch)
ecase3.2 |- (ps -> ch)
ecase3.3 |- (-. (ph \/ ps) -> ch)
Assertion
Ref Expression
ecase3 |- ch

Proof of Theorem ecase3
StepHypRef Expression
1 ioran 306 . . . 4 |- (-. (ph \/ ps) <-> (-. ph /\ -. ps))
2 ecase3.3 . . . 4 |- (-. (ph \/ ps) -> ch)
31, 2sylbir 201 . . 3 |- ((-. ph /\ -. ps) -> ch)
43ex 373 . 2 |- (-. ph -> (-. ps -> ch))
5 ecase3.1 . 2 |- (ph -> ch)
6 ecase3.2 . 2 |- (ps -> ch)
74, 5, 6pm2.61ii 130 1 |- ch
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   \/ wo 222   /\ wa 223
This theorem is referenced by:  ecase3d 754  eueq3 1919  mdsym 10338
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-or 224  df-an 225
Copyright terms: Public domain