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

Theorem pm2.61dda 768
Description: Elimination of two antecedents. (Contributed by NM, 9-Jul-2013.)
Hypotheses
Ref Expression
pm2.61dda.1
pm2.61dda.2
pm2.61dda.3
Assertion
Ref Expression
pm2.61dda

Proof of Theorem pm2.61dda
StepHypRef Expression
1 pm2.61dda.3 . . . 4
21anassrs 629 . . 3
3 pm2.61dda.2 . . . 4
43adantlr 695 . . 3
52, 4pm2.61dan 766 . 2
6 pm2.61dda.1 . 2
75, 6pm2.61dan 766 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4   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-an 360
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator