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

Theorem zfpair2 3936
Description: Derive the abbreviated version of the Axiom of Pairing from ax-pr 3935. (Contributed by NM, 14-Nov-2006.)
Assertion
Ref Expression
zfpair2  { ,  }  _V

Proof of Theorem zfpair2
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ax-pr 3935 . . . 4
21bm1.3ii 3869 . . 3
3 dfcleq 2031 . . . . 5  { ,  }  { ,  }
4 vex 2554 . . . . . . . 8 
_V
54elpr 3385 . . . . . . 7  { ,  }
65bibi2i 216 . . . . . 6 
{ ,  }
76albii 1356 . . . . 5  { ,  }
83, 7bitri 173 . . . 4  { ,  }
98exbii 1493 . . 3  { ,  }
102, 9mpbir 134 . 2  { ,  }
1110issetri 2558 1  { ,  }  _V
Colors of variables: wff set class
Syntax hints:   wb 98   wo 628  wal 1240   wceq 1242  wex 1378   wcel 1390   _Vcvv 2551   {cpr 3368
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  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bnd 1396  ax-4 1397  ax-14 1402  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019  ax-sep 3866  ax-pr 3935
This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-sb 1643  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-v 2553  df-un 2916  df-sn 3373  df-pr 3374
This theorem is referenced by:  prexgOLD  3937  prexg  3938  funopg  4877
  Copyright terms: Public domain W3C validator