Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  cases2OLD Structured version   Unicode version

Theorem cases2OLD 971
 Description: Obsolete proof of cases2 970 as of 2-Jan-2020. (Contributed by BJ, 6-Apr-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
cases2OLD

Proof of Theorem cases2OLD
StepHypRef Expression
1 pm3.4 561 . . . 4
2 simpl 457 . . . . 5
3 pm2.24 109 . . . . 5
42, 3syl 16 . . . 4
51, 4jca 532 . . 3
6 simpl 457 . . . . 5
7 pm2.21 108 . . . . 5
86, 7syl 16 . . . 4
9 pm3.4 561 . . . 4
108, 9jca 532 . . 3
115, 10jaoi 379 . 2
12 exmid 415 . . 3
13 pm2.27 39 . . . . . . 7
1413imdistani 690 . . . . . 6
1514orcd 392 . . . . 5
1615ex 434 . . . 4
17 pm2.27 39 . . . . . . 7
1817imdistani 690 . . . . . 6
1918olcd 393 . . . . 5
2019ex 434 . . . 4
2116, 20jaoa 510 . . 3
2212, 21ax-mp 5 . 2
2311, 22impbii 188 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wb 184   wo 368   wa 369 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8 This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator