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

Theorem en1 7086
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 6701 . . . . 5  |-  1o  =  { (/) }
21breq2i 4138 . . . 4  |-  ( A 
~~  1o  <->  A  ~~  { (/) } )
3 bren 7030 . . . 4  |-  ( A 
~~  { (/) }  <->  E. f 
f : A -1-1-onto-> { (/) } )
42, 3bitri 184 . . 3  |-  ( A 
~~  1o  <->  E. f  f : A -1-1-onto-> { (/) } )
5 f1ocnv 5652 . . . . 5  |-  ( f : A -1-1-onto-> { (/) }  ->  `' f : { (/) } -1-1-onto-> A )
6 f1ofo 5646 . . . . . . . 8  |-  ( `' f : { (/) } -1-1-onto-> A  ->  `' f : { (/) } -onto-> A )
7 forn 5618 . . . . . . . 8  |-  ( `' f : { (/) }
-onto-> A  ->  ran  `' f  =  A )
86, 7syl 14 . . . . . . 7  |-  ( `' f : { (/) } -1-1-onto-> A  ->  ran  `' f  =  A )
9 f1of 5639 . . . . . . . . . 10  |-  ( `' f : { (/) } -1-1-onto-> A  ->  `' f : { (/) } --> A )
10 0ex 4260 . . . . . . . . . . . 12  |-  (/)  e.  _V
1110fsn2 5882 . . . . . . . . . . 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 5011 . . . . . . . 8  |-  ( `' f : { (/) } -1-1-onto-> A  ->  ran  `' f  =  ran  { <. (/) ,  ( `' f `  (/) ) >. } )
1510rnsnop 5268 . . . . . . . 8  |-  ran  { <.
(/) ,  ( `' f `  (/) ) >. }  =  { ( `' f `  (/) ) }
1614, 15eqtrdi 2287 . . . . . . 7  |-  ( `' f : { (/) } -1-1-onto-> A  ->  ran  `' f  =  { ( `' f `
 (/) ) } )
178, 16eqtr3d 2273 . . . . . 6  |-  ( `' f : { (/) } -1-1-onto-> A  ->  A  =  {
( `' f `  (/) ) } )
185, 17syl 14 . . . . 5  |-  ( f : A -1-1-onto-> { (/) }  ->  A  =  { ( `' f `
 (/) ) } )
19 f1ofn 5640 . . . . . . 7  |-  ( `' f : { (/) } -1-1-onto-> A  ->  `' f  Fn 
{ (/) } )
2010snid 3740 . . . . . . 7  |-  (/)  e.  { (/)
}
21 funfvex 5712 . . . . . . . 8  |-  ( ( Fun  `' f  /\  (/) 
e.  dom  `' f
)  ->  ( `' f `  (/) )  e. 
_V )
2221funfni 5483 . . . . . . 7  |-  ( ( `' f  Fn  { (/) }  /\  (/)  e.  { (/) } )  ->  ( `' f `  (/) )  e. 
_V )
2319, 20, 22sylancl 417 . . . . . 6  |-  ( `' f : { (/) } -1-1-onto-> A  ->  ( `' f `
 (/) )  e.  _V )
24 sneq 3720 . . . . . . . 8  |-  ( x  =  ( `' f `
 (/) )  ->  { x }  =  { ( `' f `  (/) ) } )
2524eqeq2d 2250 . . . . . . 7  |-  ( x  =  ( `' f `
 (/) )  ->  ( A  =  { x } 
<->  A  =  { ( `' f `  (/) ) } ) )
2625spcegv 2913 . . . . . 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 1651 . . 3  |-  ( E. f  f : A -1-1-onto-> { (/)
}  ->  E. x  A  =  { x } )
304, 29sylbi 121 . 2  |-  ( A 
~~  1o  ->  E. x  A  =  { x } )
31 vex 2824 . . . . 5  |-  x  e. 
_V
3231ensn1 7083 . . . 4  |-  { x }  ~~  1o
33 breq1 4133 . . . 4  |-  ( A  =  { x }  ->  ( A  ~~  1o  <->  { x }  ~~  1o ) )
3432, 33mpbiri 168 . . 3  |-  ( A  =  { x }  ->  A  ~~  1o )
3534exlimiv 1651 . 2  |-  ( E. x  A  =  {
x }  ->  A  ~~  1o )
3630, 35impbii 126 1  |-  ( A 
~~  1o  <->  E. x  A  =  { x } )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    = wceq 1402   E.wex 1545    e. wcel 2209   _Vcvv 2821   (/)c0 3520   {csn 3709   <.cop 3712   class class class wbr 4130   `'ccnv 4773   ran crn 4775    Fn wfn 5372   -->wf 5373   -onto->wfo 5375   -1-1-onto->wf1o 5376   ` cfv 5377   1oc1o 6680    ~~ cen 7020
This proof depends on 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 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof 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-reu 2535  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1o 6687  df-en 7023
This theorem is used by:  en1bg  7087  reuen1  7088  eqsndc  7210  pm54.43  7536  upgrex  16344  vtxdumgrfival  16539  1loopgrvd2fi  16546
  Copyright terms: Public domain W3C validator