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

Theorem fo1st 6391
Description: The  1st function maps the universe onto the universe. (Contributed by NM, 14-Oct-2004.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
fo1st  |-  1st : _V -onto-> _V

Proof of Theorem fo1st
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2824 . . . . . 6  |-  x  e. 
_V
21snex 4322 . . . . 5  |-  { x }  e.  _V
32dmex 5049 . . . 4  |-  dom  {
x }  e.  _V
43uniex 4583 . . 3  |-  U. dom  { x }  e.  _V
5 df-1st 6374 . . 3  |-  1st  =  ( x  e.  _V  |->  U.
dom  { x } )
64, 5fnmpti 5512 . 2  |-  1st  Fn  _V
75rnmpt 5030 . . 3  |-  ran  1st  =  { y  |  E. x  e.  _V  y  =  U. dom  { x } }
8 vex 2824 . . . . 5  |-  y  e. 
_V
98, 8opex 4369 . . . . . 6  |-  <. y ,  y >.  e.  _V
108, 8op1sta 5269 . . . . . . 7  |-  U. dom  {
<. y ,  y >. }  =  y
1110eqcomi 2242 . . . . . 6  |-  y  = 
U. dom  { <. y ,  y >. }
12 sneq 3720 . . . . . . . . . 10  |-  ( x  =  <. y ,  y
>.  ->  { x }  =  { <. y ,  y
>. } )
1312dmeqd 4983 . . . . . . . . 9  |-  ( x  =  <. y ,  y
>.  ->  dom  { x }  =  dom  { <. y ,  y >. } )
1413unieqd 3946 . . . . . . . 8  |-  ( x  =  <. y ,  y
>.  ->  U. dom  { x }  =  U. dom  { <. y ,  y >. } )
1514eqeq2d 2250 . . . . . . 7  |-  ( x  =  <. y ,  y
>.  ->  ( y  = 
U. dom  { x } 
<->  y  =  U. dom  {
<. y ,  y >. } ) )
1615rspcev 2929 . . . . . 6  |-  ( (
<. y ,  y >.  e.  _V  /\  y  = 
U. dom  { <. y ,  y >. } )  ->  E. x  e.  _V  y  =  U. dom  {
x } )
179, 11, 16mp2an 430 . . . . 5  |-  E. x  e.  _V  y  =  U. dom  { x }
188, 172th 174 . . . 4  |-  ( y  e.  _V  <->  E. x  e.  _V  y  =  U. dom  { x } )
1918abbi2i 2353 . . 3  |-  _V  =  { y  |  E. x  e.  _V  y  =  U. dom  { x } }
207, 19eqtr4i 2262 . 2  |-  ran  1st  =  _V
21 df-fo 5383 . 2  |-  ( 1st
: _V -onto-> _V  <->  ( 1st  Fn 
_V  /\  ran  1st  =  _V ) )
226, 20, 21mpbir2an 955 1  |-  1st : _V -onto-> _V
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402    e. wcel 2209   {cab 2224   E.wrex 2529   _Vcvv 2821   {csn 3709   <.cop 3712   U.cuni 3935   dom cdm 4774   ran crn 4775    Fn wfn 5372   -onto->wfo 5375   1stc1st 6372
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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-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-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-fun 5379  df-fn 5380  df-fo 5383  df-1st 6374
This theorem is used by:  1stcof  6397  1stexg  6401  df1st2  6455  1stconst  6457  algrflem  6465  algrflemg  6466  suplocexprlemell  8080  suplocexprlem2b  8081  suplocexprlemlub  8091  upxp  15373  uptx  15375  cnmpt1st  15389
  Copyright terms: Public domain W3C validator