NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  ccased Unicode version

Theorem ccased 913
Description: Deduction for combining cases. (Contributed by NM, 9-May-2004.)
Hypotheses
Ref Expression
ccased.1
ccased.2
ccased.3
ccased.4
Assertion
Ref Expression
ccased

Proof of Theorem ccased
StepHypRef Expression
1 ccased.1 . . . 4
21com12 27 . . 3
3 ccased.2 . . . 4
43com12 27 . . 3
5 ccased.3 . . . 4
65com12 27 . . 3
7 ccased.4 . . . 4
87com12 27 . . 3
92, 4, 6, 8ccase 912 . 2
109com12 27 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wo 357   wa 358
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 177  df-or 359  df-an 360
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator