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

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

Proof of Theorem fo2nd
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2816 . . . . . 6  |-  x  e. 
_V
21snex 4298 . . . . 5  |-  { x }  e.  _V
32rnex 5025 . . . 4  |-  ran  {
x }  e.  _V
43uniex 4558 . . 3  |-  U. ran  { x }  e.  _V
5 df-2nd 6335 . . 3  |-  2nd  =  ( x  e.  _V  |->  U.
ran  { x } )
64, 5fnmpti 5487 . 2  |-  2nd  Fn  _V
75rnmpt 5005 . . 3  |-  ran  2nd  =  { y  |  E. x  e.  _V  y  =  U. ran  { x } }
8 vex 2816 . . . . 5  |-  y  e. 
_V
98, 8opex 4345 . . . . . 6  |-  <. y ,  y >.  e.  _V
108, 8op2nda 5247 . . . . . . 7  |-  U. ran  {
<. y ,  y >. }  =  y
1110eqcomi 2236 . . . . . 6  |-  y  = 
U. ran  { <. y ,  y >. }
12 sneq 3700 . . . . . . . . . 10  |-  ( x  =  <. y ,  y
>.  ->  { x }  =  { <. y ,  y
>. } )
1312rneqd 4986 . . . . . . . . 9  |-  ( x  =  <. y ,  y
>.  ->  ran  { x }  =  ran  { <. y ,  y >. } )
1413unieqd 3925 . . . . . . . 8  |-  ( x  =  <. y ,  y
>.  ->  U. ran  { x }  =  U. ran  { <. y ,  y >. } )
1514eqeq2d 2244 . . . . . . 7  |-  ( x  =  <. y ,  y
>.  ->  ( y  = 
U. ran  { x } 
<->  y  =  U. ran  {
<. y ,  y >. } ) )
1615rspcev 2921 . . . . . 6  |-  ( (
<. y ,  y >.  e.  _V  /\  y  = 
U. ran  { <. y ,  y >. } )  ->  E. x  e.  _V  y  =  U. ran  {
x } )
179, 11, 16mp2an 426 . . . . 5  |-  E. x  e.  _V  y  =  U. ran  { x }
188, 172th 174 . . . 4  |-  ( y  e.  _V  <->  E. x  e.  _V  y  =  U. ran  { x } )
1918abbi2i 2347 . . 3  |-  _V  =  { y  |  E. x  e.  _V  y  =  U. ran  { x } }
207, 19eqtr4i 2256 . 2  |-  ran  2nd  =  _V
21 df-fo 5358 . 2  |-  ( 2nd
: _V -onto-> _V  <->  ( 2nd  Fn 
_V  /\  ran  2nd  =  _V ) )
226, 20, 21mpbir2an 951 1  |-  2nd : _V -onto-> _V
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2203   {cab 2218   E.wrex 2521   _Vcvv 2813   {csn 3689   <.cop 3692   U.cuni 3914   ran crn 4750    Fn wfn 5347   -onto->wfo 5350   2ndc2nd 6333
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-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 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-fun 5354  df-fn 5355  df-fo 5358  df-2nd 6335
This theorem is referenced by:  2ndcof  6358  2ndexg  6362  df2nd2  6416  2ndconst  6418  suplocexprlemmu  8033  suplocexprlemdisj  8035  suplocexprlemloc  8036  suplocexprlemub  8038  upxp  15137  uptx  15139  cnmpt2nd  15154
  Copyright terms: Public domain W3C validator