Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  pm5.21nd Unicode version

Theorem pm5.21nd 873
 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 425 . 2
3 pm5.21nd.2 . . 3
43ex 425 . 2
5 pm5.21nd.3 . . 3
65a1i 12 . 2
72, 4, 6pm5.21ndd 345 1
 Colors of variables: wff set class Syntax hints:   wi 6   wb 178   wa 360 This theorem is referenced by:  ordsucelsuc  4504  ideqg  4742  fvelimab  5430  releldm2  6022  relbrtpos  6097  brrpssg  6131  relelec  6586  elfiun  7067  fpwwe2lem2  8134  fpwwelem  8147  fzrev3  10727  elfzp12  10739  eqgval  14501  eltg  16527  eltg2  16528  cncnp2  16842  isdivrngo  20928  domrancur1b  24366  isfne  25434  isref  25445  islocfin  25462  opelopab3  25539  islshpkrN  27999  dihatexv2  30218 This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10 This theorem depends on definitions:  df-bi 179  df-an 362
 Copyright terms: Public domain W3C validator