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

Theorem ecase2d 824
Description: Deduction for elimination by cases.
Hypotheses
Ref Expression
ecase2d.1 |- (ph -> ps)
ecase2d.2 |- (ph -> -. (ps /\ ch))
ecase2d.3 |- (ph -> -. (ps /\ th))
ecase2d.4 |- (ph -> (ta \/ (ch \/ th)))
Assertion
Ref Expression
ecase2d |- (ph -> ta)

Proof of Theorem ecase2d
StepHypRef Expression
1 ioran 331 . . 3 |- (-. (ch \/ th) <-> (-. ch /\ -. th))
2 ecase2d.1 . . . 4 |- (ph -> ps)
3 ecase2d.2 . . . . 5 |- (ph -> -. (ps /\ ch))
4 imnan 261 . . . . 5 |- ((ps -> -. ch) <-> -. (ps /\ ch))
53, 4sylibr 217 . . . 4 |- (ph -> (ps -> -. ch))
62, 5mpd 29 . . 3 |- (ph -> -. ch)
7 ecase2d.3 . . . . 5 |- (ph -> -. (ps /\ th))
8 imnan 261 . . . . 5 |- ((ps -> -. th) <-> -. (ps /\ th))
97, 8sylibr 217 . . . 4 |- (ph -> (ps -> -. th))
102, 9mpd 29 . . 3 |- (ph -> -. th)
111, 6, 10sylanbrc 527 . 2 |- (ph -> -. (ch \/ th))
12 ecase2d.4 . . . 4 |- (ph -> (ta \/ (ch \/ th)))
13 orcom 266 . . . 4 |- ((ta \/ (ch \/ th)) <-> ((ch \/ th) \/ ta))
1412, 13sylib 215 . . 3 |- (ph -> ((ch \/ th) \/ ta))
1514ord 249 . 2 |- (ph -> (-. (ch \/ th) -> ta))
1611, 15mpd 29 1 |- (ph -> ta)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   \/ wo 239   /\ wa 240
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 164  df-or 241  df-an 242
Copyright terms: Public domain