MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fo1st Structured version   Visualization version   Unicode version

Theorem fo1st 7188
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 snex 4908 . . . . 5  |-  { x }  e.  _V
21dmex 7099 . . . 4  |-  dom  {
x }  e.  _V
32uniex 6953 . . 3  |-  U. dom  { x }  e.  _V
4 df-1st 7168 . . 3  |-  1st  =  ( x  e.  _V  |->  U.
dom  { x } )
53, 4fnmpti 6022 . 2  |-  1st  Fn  _V
64rnmpt 5371 . . 3  |-  ran  1st  =  { y  |  E. x  e.  _V  y  =  U. dom  { x } }
7 vex 3203 . . . . 5  |-  y  e. 
_V
8 opex 4932 . . . . . 6  |-  <. y ,  y >.  e.  _V
97, 7op1sta 5617 . . . . . . 7  |-  U. dom  {
<. y ,  y >. }  =  y
109eqcomi 2631 . . . . . 6  |-  y  = 
U. dom  { <. y ,  y >. }
11 sneq 4187 . . . . . . . . . 10  |-  ( x  =  <. y ,  y
>.  ->  { x }  =  { <. y ,  y
>. } )
1211dmeqd 5326 . . . . . . . . 9  |-  ( x  =  <. y ,  y
>.  ->  dom  { x }  =  dom  { <. y ,  y >. } )
1312unieqd 4446 . . . . . . . 8  |-  ( x  =  <. y ,  y
>.  ->  U. dom  { x }  =  U. dom  { <. y ,  y >. } )
1413eqeq2d 2632 . . . . . . 7  |-  ( x  =  <. y ,  y
>.  ->  ( y  = 
U. dom  { x } 
<->  y  =  U. dom  {
<. y ,  y >. } ) )
1514rspcev 3309 . . . . . 6  |-  ( (
<. y ,  y >.  e.  _V  /\  y  = 
U. dom  { <. y ,  y >. } )  ->  E. x  e.  _V  y  =  U. dom  {
x } )
168, 10, 15mp2an 708 . . . . 5  |-  E. x  e.  _V  y  =  U. dom  { x }
177, 162th 254 . . . 4  |-  ( y  e.  _V  <->  E. x  e.  _V  y  =  U. dom  { x } )
1817abbi2i 2738 . . 3  |-  _V  =  { y  |  E. x  e.  _V  y  =  U. dom  { x } }
196, 18eqtr4i 2647 . 2  |-  ran  1st  =  _V
20 df-fo 5894 . 2  |-  ( 1st
: _V -onto-> _V  <->  ( 1st  Fn 
_V  /\  ran  1st  =  _V ) )
215, 19, 20mpbir2an 955 1  |-  1st : _V -onto-> _V
Colors of variables: wff setvar class
Syntax hints:    = wceq 1483    e. wcel 1990   {cab 2608   E.wrex 2913   _Vcvv 3200   {csn 4177   <.cop 4183   U.cuni 4436   dom cdm 5114   ran crn 5115    Fn wfn 5883   -onto->wfo 5886   1stc1st 7166
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-fun 5890  df-fn 5891  df-fo 5894  df-1st 7168
This theorem is referenced by:  1stcof  7196  df1st2  7263  1stconst  7265  fsplit  7282  algrflem  7286  fpwwe  9468  axpre-sup  9990  homadm  16690  homacd  16691  dmaf  16699  cdaf  16700  1stf1  16832  1stf2  16833  1stfcl  16837  upxp  21426  uptx  21428  cnmpt1st  21471  bcthlem4  23124  uniiccdif  23346  vafval  27458  smfval  27460  0vfval  27461  vsfval  27488  xppreima  29449  xppreima2  29450  1stpreimas  29483  1stpreima  29484  gsummpt2d  29781  cnre2csqima  29957  br1steq  31670  br1steqg  31672  poimirlem26  33435  poimirlem27  33436
  Copyright terms: Public domain W3C validator