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

Theorem en2 7102
Description: A set equinumerous to ordinal 2 is an unordered pair. (Contributed by Mario Carneiro, 5-Jan-2016.)
Assertion
Ref Expression
en2  |-  ( A 
~~  2o  ->  E. x E. y  A  =  { x ,  y } )
Distinct variable group:    x, A, y

Proof of Theorem en2
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 bren 7020 . . 3  |-  ( A 
~~  2o  <->  E. f  f : A -1-1-onto-> 2o )
21biimpi 120 . 2  |-  ( A 
~~  2o  ->  E. f 
f : A -1-1-onto-> 2o )
3 cnvimarndm 5146 . . . . 5  |-  ( `' f " ran  f
)  =  dom  f
4 dff1o2 5639 . . . . . . . . 9  |-  ( f : A -1-1-onto-> 2o  <->  ( f  Fn  A  /\  Fun  `' f  /\  ran  f  =  2o ) )
54simp3bi 1045 . . . . . . . 8  |-  ( f : A -1-1-onto-> 2o  ->  ran  f  =  2o )
6 df2o3 6692 . . . . . . . 8  |-  2o  =  { (/) ,  1o }
75, 6eqtrdi 2287 . . . . . . 7  |-  ( f : A -1-1-onto-> 2o  ->  ran  f  =  { (/) ,  1o }
)
87imaeq2d 5121 . . . . . 6  |-  ( f : A -1-1-onto-> 2o  ->  ( `' f " ran  f )  =  ( `' f
" { (/) ,  1o } ) )
98adantl 277 . . . . 5  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  ( `' f " ran  f )  =  ( `' f " { (/)
,  1o } ) )
103, 9eqtr3id 2285 . . . 4  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  dom  f  =  ( `' f " { (/) ,  1o } ) )
11 f1odm 5638 . . . . 5  |-  ( f : A -1-1-onto-> 2o  ->  dom  f  =  A )
1211adantl 277 . . . 4  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  dom  f  =  A )
13 f1ocnv 5647 . . . . . . 7  |-  ( f : A -1-1-onto-> 2o  ->  `' f : 2o -1-1-onto-> A )
1413adantl 277 . . . . . 6  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  `' f : 2o -1-1-onto-> A )
15 f1ofn 5635 . . . . . 6  |-  ( `' f : 2o -1-1-onto-> A  ->  `' f  Fn  2o )
1614, 15syl 14 . . . . 5  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  `' f  Fn  2o )
17 0lt2o 6704 . . . . . 6  |-  (/)  e.  2o
1817a1i 9 . . . . 5  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  (/)  e.  2o )
19 1lt2o 6705 . . . . . 6  |-  1o  e.  2o
2019a1i 9 . . . . 5  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  1o  e.  2o )
21 fnimapr 5757 . . . . 5  |-  ( ( `' f  Fn  2o  /\  (/)  e.  2o  /\  1o  e.  2o )  ->  ( `' f " { (/)
,  1o } )  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) } )
2216, 18, 20, 21syl3anc 1278 . . . 4  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  ( `' f " { (/)
,  1o } )  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) } )
2310, 12, 223eqtr3d 2279 . . 3  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  A  =  { ( `' f `
 (/) ) ,  ( `' f `  1o ) } )
24 simpr 110 . . . . 5  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  f : A -1-1-onto-> 2o )
25 f1ocnvdm 5977 . . . . 5  |-  ( ( f : A -1-1-onto-> 2o  /\  (/) 
e.  2o )  -> 
( `' f `  (/) )  e.  A )
2624, 17, 25sylancl 417 . . . 4  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  ( `' f `  (/) )  e.  A )
27 f1ocnvdm 5977 . . . . . 6  |-  ( ( f : A -1-1-onto-> 2o  /\  1o  e.  2o )  -> 
( `' f `  1o )  e.  A
)
2824, 19, 27sylancl 417 . . . . 5  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  ( `' f `  1o )  e.  A )
29 preq2 3785 . . . . . . 7  |-  ( y  =  ( `' f `
 1o )  ->  { ( `' f `
 (/) ) ,  y }  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) } )
3029eqeq2d 2250 . . . . . 6  |-  ( y  =  ( `' f `
 1o )  -> 
( A  =  {
( `' f `  (/) ) ,  y }  <-> 
A  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) } ) )
3130spcegv 2913 . . . . 5  |-  ( ( `' f `  1o )  e.  A  ->  ( A  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) }  ->  E. y  A  =  { ( `' f `  (/) ) ,  y } ) )
3228, 31syl 14 . . . 4  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  ( A  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) }  ->  E. y  A  =  { ( `' f `  (/) ) ,  y } ) )
33 preq1 3784 . . . . . . 7  |-  ( x  =  ( `' f `
 (/) )  ->  { x ,  y }  =  { ( `' f `
 (/) ) ,  y } )
3433eqeq2d 2250 . . . . . 6  |-  ( x  =  ( `' f `
 (/) )  ->  ( A  =  { x ,  y }  <->  A  =  { ( `' f `
 (/) ) ,  y } ) )
3534exbidv 1878 . . . . 5  |-  ( x  =  ( `' f `
 (/) )  ->  ( E. y  A  =  { x ,  y }  <->  E. y  A  =  { ( `' f `
 (/) ) ,  y } ) )
3635spcegv 2913 . . . 4  |-  ( ( `' f `  (/) )  e.  A  ->  ( E. y  A  =  {
( `' f `  (/) ) ,  y }  ->  E. x E. y  A  =  { x ,  y } ) )
3726, 32, 36sylsyld 58 . . 3  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  ( A  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) }  ->  E. x E. y  A  =  { x ,  y } ) )
3823, 37mpd 13 . 2  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  E. x E. y  A  =  { x ,  y } )
392, 38exlimddv 1954 1  |-  ( A 
~~  2o  ->  E. x E. y  A  =  { x ,  y } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402   E.wex 1545    e. wcel 2209   (/)c0 3520   {cpr 3706   class class class wbr 4125   `'ccnv 4768   dom cdm 4769   ran crn 4770   "cima 4772   Fun wfun 5366    Fn wfn 5367   -1-1-onto->wf1o 5371   ` cfv 5372   1oc1o 6670   2oc2o 6671    ~~ cen 7010
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-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-1o 6677  df-2o 6678  df-en 7013
This theorem is referenced by:  en2m  7103  en2prde  7529  upgrex  16258  upgr1een  16279
  Copyright terms: Public domain W3C validator