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

Theorem 4casesdan 918
 Description: Deduction eliminating two antecedents from the four possible cases that result from their true/false combinations. (Contributed by NM, 19-Mar-2013.)
Hypotheses
Ref Expression
4casesdan.1
4casesdan.2
4casesdan.3
4casesdan.4
Assertion
Ref Expression
4casesdan

Proof of Theorem 4casesdan
StepHypRef Expression
1 4casesdan.1 . . 3
21expcom 426 . 2
3 4casesdan.2 . . 3
43expcom 426 . 2
5 4casesdan.3 . . 3
65expcom 426 . 2
7 4casesdan.4 . . 3
87expcom 426 . 2
92, 4, 6, 84cases 917 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wa 360 This theorem is referenced by:  unxpdomlem3  7317  cdleme41snaw  31275  dihord  32064  dihjat  32223 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8 This theorem depends on definitions:  df-bi 179  df-an 362
 Copyright terms: Public domain W3C validator