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

Theorem en2 6993
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 6912 . . 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 5098 . . . . 5  |-  ( `' f " ran  f
)  =  dom  f
4 dff1o2 5585 . . . . . . . . 9  |-  ( f : A -1-1-onto-> 2o  <->  ( f  Fn  A  /\  Fun  `' f  /\  ran  f  =  2o ) )
54simp3bi 1038 . . . . . . . 8  |-  ( f : A -1-1-onto-> 2o  ->  ran  f  =  2o )
6 df2o3 6592 . . . . . . . 8  |-  2o  =  { (/) ,  1o }
75, 6eqtrdi 2278 . . . . . . 7  |-  ( f : A -1-1-onto-> 2o  ->  ran  f  =  { (/) ,  1o }
)
87imaeq2d 5074 . . . . . 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 2276 . . . 4  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  dom  f  =  ( `' f " { (/) ,  1o } ) )
11 f1odm 5584 . . . . 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 5593 . . . . . . 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 5581 . . . . . 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 6604 . . . . . 6  |-  (/)  e.  2o
1817a1i 9 . . . . 5  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  (/)  e.  2o )
19 1lt2o 6605 . . . . . 6  |-  1o  e.  2o
2019a1i 9 . . . . 5  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  1o  e.  2o )
21 fnimapr 5702 . . . . 5  |-  ( ( `' f  Fn  2o  /\  (/)  e.  2o  /\  1o  e.  2o )  ->  ( `' f " { (/)
,  1o } )  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) } )
2216, 18, 20, 21syl3anc 1271 . . . 4  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  ( `' f " { (/)
,  1o } )  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) } )
2310, 12, 223eqtr3d 2270 . . 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 5917 . . . . 5  |-  ( ( f : A -1-1-onto-> 2o  /\  (/) 
e.  2o )  -> 
( `' f `  (/) )  e.  A )
2624, 17, 25sylancl 413 . . . 4  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  ( `' f `  (/) )  e.  A )
27 f1ocnvdm 5917 . . . . . 6  |-  ( ( f : A -1-1-onto-> 2o  /\  1o  e.  2o )  -> 
( `' f `  1o )  e.  A
)
2824, 19, 27sylancl 413 . . . . 5  |-  ( ( A  ~~  2o  /\  f : A -1-1-onto-> 2o )  ->  ( `' f `  1o )  e.  A )
29 preq2 3747 . . . . . . 7  |-  ( y  =  ( `' f `
 1o )  ->  { ( `' f `
 (/) ) ,  y }  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) } )
3029eqeq2d 2241 . . . . . 6  |-  ( y  =  ( `' f `
 1o )  -> 
( A  =  {
( `' f `  (/) ) ,  y }  <-> 
A  =  { ( `' f `  (/) ) ,  ( `' f `  1o ) } ) )
3130spcegv 2892 . . . . 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 3746 . . . . . . 7  |-  ( x  =  ( `' f `
 (/) )  ->  { x ,  y }  =  { ( `' f `
 (/) ) ,  y } )
3433eqeq2d 2241 . . . . . 6  |-  ( x  =  ( `' f `
 (/) )  ->  ( A  =  { x ,  y }  <->  A  =  { ( `' f `
 (/) ) ,  y } ) )
3534exbidv 1871 . . . . 5  |-  ( x  =  ( `' f `
 (/) )  ->  ( E. y  A  =  { x ,  y }  <->  E. y  A  =  { ( `' f `
 (/) ) ,  y } ) )
3635spcegv 2892 . . . 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 1945 1  |-  ( A 
~~  2o  ->  E. x E. y  A  =  { x ,  y } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395   E.wex 1538    e. wcel 2200   (/)c0 3492   {cpr 3668   class class class wbr 4086   `'ccnv 4722   dom cdm 4723   ran crn 4724   "cima 4726   Fun wfun 5318    Fn wfn 5319   -1-1-onto->wf1o 5323   ` cfv 5324   1oc1o 6570   2oc2o 6571    ~~ cen 6902
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-1o 6577  df-2o 6578  df-en 6905
This theorem is referenced by:  en2m  6994  en2prde  7389  upgrex  15944
  Copyright terms: Public domain W3C validator