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

Theorem zfpair2 4204
Description: Derive the abbreviated version of the Axiom of Pairing from ax-pr 4203. (Contributed by NM, 14-Nov-2006.)
Assertion
Ref Expression
zfpair2  |-  { x ,  y }  e.  _V

Proof of Theorem zfpair2
Dummy variables  z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ax-pr 4203 . . . 4  |-  E. z A. w ( ( w  =  x  \/  w  =  y )  ->  w  e.  z )
21bm1.3ii 4119 . . 3  |-  E. z A. w ( w  e.  z  <->  ( w  =  x  \/  w  =  y ) )
3 dfcleq 2169 . . . . 5  |-  ( z  =  { x ,  y }  <->  A. w
( w  e.  z  <-> 
w  e.  { x ,  y } ) )
4 vex 2738 . . . . . . . 8  |-  w  e. 
_V
54elpr 3610 . . . . . . 7  |-  ( w  e.  { x ,  y }  <->  ( w  =  x  \/  w  =  y ) )
65bibi2i 227 . . . . . 6  |-  ( ( w  e.  z  <->  w  e.  { x ,  y } )  <->  ( w  e.  z  <->  ( w  =  x  \/  w  =  y ) ) )
76albii 1468 . . . . 5  |-  ( A. w ( w  e.  z  <->  w  e.  { x ,  y } )  <->  A. w ( w  e.  z  <->  ( w  =  x  \/  w  =  y ) ) )
83, 7bitri 184 . . . 4  |-  ( z  =  { x ,  y }  <->  A. w
( w  e.  z  <-> 
( w  =  x  \/  w  =  y ) ) )
98exbii 1603 . . 3  |-  ( E. z  z  =  {
x ,  y }  <->  E. z A. w ( w  e.  z  <->  ( w  =  x  \/  w  =  y ) ) )
102, 9mpbir 146 . 2  |-  E. z 
z  =  { x ,  y }
1110issetri 2744 1  |-  { x ,  y }  e.  _V
Colors of variables: wff set class
Syntax hints:    <-> wb 105    \/ wo 708   A.wal 1351    = wceq 1353   E.wex 1490    e. wcel 2146   _Vcvv 2735   {cpr 3590
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pr 4203
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1459  df-sb 1761  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-v 2737  df-un 3131  df-sn 3595  df-pr 3596
This theorem is referenced by:  prexg  4205  onintexmid  4566  funopg  5242
  Copyright terms: Public domain W3C validator