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

Theorem pm5.21nd 868
Description: Eliminate an antecedent implied by each side of a biconditional. (Contributed by NM, 20-Nov-2005.) (Proof shortened by Wolf Lammen, 4-Nov-2013.)
Hypotheses
Ref Expression
pm5.21nd.1
pm5.21nd.2
pm5.21nd.3
Assertion
Ref Expression
pm5.21nd

Proof of Theorem pm5.21nd
StepHypRef Expression
1 pm5.21nd.1 . . 3
21ex 423 . 2
3 pm5.21nd.2 . . 3
43ex 423 . 2
5 pm5.21nd.3 . . 3
65a1i 10 . 2
72, 4, 6pm5.21ndd 343 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176   wa 358
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 177  df-an 360
This theorem is referenced by:  ideqg  4868  ideqg2  4869  fvelimab  5370
  Copyright terms: Public domain W3C validator