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

Theorem en1 7052
Description: A set is equinumerous to ordinal one iff it is a singleton. (Contributed by NM, 25-Jul-2004.)
Assertion
Ref Expression
en1  |-  ( A 
~~  1o  <->  E. x  A  =  { x } )
Distinct variable group:    x, A

Proof of Theorem en1
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 df1o2 6674 . . . . 5  |-  1o  =  { (/) }
21breq2i 4122 . . . 4  |-  ( A 
~~  1o  <->  A  ~~  { (/) } )
3 bren 6996 . . . 4  |-  ( A 
~~  { (/) }  <->  E. f 
f : A -1-1-onto-> { (/) } )
42, 3bitri 184 . . 3  |-  ( A 
~~  1o  <->  E. f  f : A -1-1-onto-> { (/) } )
5 f1ocnv 5632 . . . . 5  |-  ( f : A -1-1-onto-> { (/) }  ->  `' f : { (/) } -1-1-onto-> A )
6 f1ofo 5626 . . . . . . . 8  |-  ( `' f : { (/) } -1-1-onto-> A  ->  `' f : { (/) } -onto-> A )
7 forn 5598 . . . . . . . 8  |-  ( `' f : { (/) }
-onto-> A  ->  ran  `' f  =  A )
86, 7syl 14 . . . . . . 7  |-  ( `' f : { (/) } -1-1-onto-> A  ->  ran  `' f  =  A )
9 f1of 5619 . . . . . . . . . 10  |-  ( `' f : { (/) } -1-1-onto-> A  ->  `' f : { (/) } --> A )
10 0ex 4242 . . . . . . . . . . . 12  |-  (/)  e.  _V
1110fsn2 5856 . . . . . . . . . . 11  |-  ( `' f : { (/) } --> A  <->  ( ( `' f `  (/) )  e.  A  /\  `' f  =  { <. (/) ,  ( `' f `  (/) ) >. } ) )
1211simprbi 275 . . . . . . . . . 10  |-  ( `' f : { (/) } --> A  ->  `' f  =  { <. (/) ,  ( `' f `  (/) ) >. } )
139, 12syl 14 . . . . . . . . 9  |-  ( `' f : { (/) } -1-1-onto-> A  ->  `' f  =  { <. (/) ,  ( `' f `  (/) ) >. } )
1413rneqd 4991 . . . . . . . 8  |-  ( `' f : { (/) } -1-1-onto-> A  ->  ran  `' f  =  ran  { <. (/) ,  ( `' f `  (/) ) >. } )
1510rnsnop 5248 . . . . . . . 8  |-  ran  { <.
(/) ,  ( `' f `  (/) ) >. }  =  { ( `' f `  (/) ) }
1614, 15eqtrdi 2283 . . . . . . 7  |-  ( `' f : { (/) } -1-1-onto-> A  ->  ran  `' f  =  { ( `' f `
 (/) ) } )
178, 16eqtr3d 2269 . . . . . 6  |-  ( `' f : { (/) } -1-1-onto-> A  ->  A  =  {
( `' f `  (/) ) } )
185, 17syl 14 . . . . 5  |-  ( f : A -1-1-onto-> { (/) }  ->  A  =  { ( `' f `
 (/) ) } )
19 f1ofn 5620 . . . . . . 7  |-  ( `' f : { (/) } -1-1-onto-> A  ->  `' f  Fn 
{ (/) } )
2010snid 3725 . . . . . . 7  |-  (/)  e.  { (/)
}
21 funfvex 5692 . . . . . . . 8  |-  ( ( Fun  `' f  /\  (/) 
e.  dom  `' f
)  ->  ( `' f `  (/) )  e. 
_V )
2221funfni 5463 . . . . . . 7  |-  ( ( `' f  Fn  { (/) }  /\  (/)  e.  { (/) } )  ->  ( `' f `  (/) )  e. 
_V )
2319, 20, 22sylancl 413 . . . . . 6  |-  ( `' f : { (/) } -1-1-onto-> A  ->  ( `' f `
 (/) )  e.  _V )
24 sneq 3705 . . . . . . . 8  |-  ( x  =  ( `' f `
 (/) )  ->  { x }  =  { ( `' f `  (/) ) } )
2524eqeq2d 2246 . . . . . . 7  |-  ( x  =  ( `' f `
 (/) )  ->  ( A  =  { x } 
<->  A  =  { ( `' f `  (/) ) } ) )
2625spcegv 2907 . . . . . 6  |-  ( ( `' f `  (/) )  e. 
_V  ->  ( A  =  { ( `' f `
 (/) ) }  ->  E. x  A  =  {
x } ) )
2723, 26syl 14 . . . . 5  |-  ( `' f : { (/) } -1-1-onto-> A  ->  ( A  =  { ( `' f `
 (/) ) }  ->  E. x  A  =  {
x } ) )
285, 18, 27sylc 62 . . . 4  |-  ( f : A -1-1-onto-> { (/) }  ->  E. x  A  =  { x } )
2928exlimiv 1647 . . 3  |-  ( E. f  f : A -1-1-onto-> { (/)
}  ->  E. x  A  =  { x } )
304, 29sylbi 121 . 2  |-  ( A 
~~  1o  ->  E. x  A  =  { x } )
31 vex 2818 . . . . 5  |-  x  e. 
_V
3231ensn1 7049 . . . 4  |-  { x }  ~~  1o
33 breq1 4117 . . . 4  |-  ( A  =  { x }  ->  ( A  ~~  1o  <->  { x }  ~~  1o ) )
3432, 33mpbiri 168 . . 3  |-  ( A  =  { x }  ->  A  ~~  1o )
3534exlimiv 1647 . 2  |-  ( E. x  A  =  {
x }  ->  A  ~~  1o )
3630, 35impbii 126 1  |-  ( A 
~~  1o  <->  E. x  A  =  { x } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1398   E.wex 1541    e. wcel 2205   _Vcvv 2815   (/)c0 3512   {csn 3694   <.cop 3697   class class class wbr 4114   `'ccnv 4753   ran crn 4755    Fn wfn 5352   -->wf 5353   -onto->wfo 5355   -1-1-onto->wf1o 5356   ` cfv 5357   1oc1o 6653    ~~ cen 6986
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-1o 6660  df-en 6989
This theorem is referenced by:  en1bg  7053  reuen1  7054  eqsndc  7176  pm54.43  7500  upgrex  16224  vtxdumgrfival  16419  1loopgrvd2fi  16426
  Copyright terms: Public domain W3C validator