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

Theorem zfpair2 4140
Description: Derive the abbreviated version of the Axiom of Pairing from ax-pr 4139. (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 4139 . . . 4  |-  E. z A. w ( ( w  =  x  \/  w  =  y )  ->  w  e.  z )
21bm1.3ii 4057 . . 3  |-  E. z A. w ( w  e.  z  <->  ( w  =  x  \/  w  =  y ) )
3 dfcleq 2134 . . . . 5  |-  ( z  =  { x ,  y }  <->  A. w
( w  e.  z  <-> 
w  e.  { x ,  y } ) )
4 vex 2692 . . . . . . . 8  |-  w  e. 
_V
54elpr 3553 . . . . . . 7  |-  ( w  e.  { x ,  y }  <->  ( w  =  x  \/  w  =  y ) )
65bibi2i 226 . . . . . 6  |-  ( ( w  e.  z  <->  w  e.  { x ,  y } )  <->  ( w  e.  z  <->  ( w  =  x  \/  w  =  y ) ) )
76albii 1447 . . . . 5  |-  ( A. w ( w  e.  z  <->  w  e.  { x ,  y } )  <->  A. w ( w  e.  z  <->  ( w  =  x  \/  w  =  y ) ) )
83, 7bitri 183 . . . 4  |-  ( z  =  { x ,  y }  <->  A. w
( w  e.  z  <-> 
( w  =  x  \/  w  =  y ) ) )
98exbii 1585 . . 3  |-  ( E. z  z  =  {
x ,  y }  <->  E. z A. w ( w  e.  z  <->  ( w  =  x  \/  w  =  y ) ) )
102, 9mpbir 145 . 2  |-  E. z 
z  =  { x ,  y }
1110issetri 2698 1  |-  { x ,  y }  e.  _V
Colors of variables: wff set class
Syntax hints:    <-> wb 104    \/ wo 698   A.wal 1330    = wceq 1332   E.wex 1469    e. wcel 1481   _Vcvv 2689   {cpr 3533
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pr 4139
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-un 3080  df-sn 3538  df-pr 3539
This theorem is referenced by:  prexg  4141  onintexmid  4495  funopg  5165
  Copyright terms: Public domain W3C validator