ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ccase Unicode version

Theorem ccase 870
Description: Inference for combining cases. (Contributed by NM, 29-Jul-1999.) (Proof shortened by Wolf Lammen, 6-Jan-2013.)
Hypotheses
Ref Expression
ccase.1
ccase.2
ccase.3
ccase.4
Assertion
Ref Expression
ccase

Proof of Theorem ccase
StepHypRef Expression
1 ccase.1 . . 3
2 ccase.2 . . 3
31, 2jaoian 708 . 2
4 ccase.3 . . 3
5 ccase.4 . . 3
64, 5jaoian 708 . 2
73, 6jaodan 709 1
Colors of variables: wff set class
Syntax hints:   wi 4   wa 97   wo 628
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629
This theorem depends on definitions:  df-bi 110
This theorem is referenced by:  ccased  871  ccase2  872  undif3ss  3192
  Copyright terms: Public domain W3C validator