Theorem fo2nd 6396

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.

Step	Hyp	Ref	Expression
1		vex 2824	. . . . . 6 |- x e. _V
2	1	snex 4324	. . . . 5 |- { x } e. _V
3	2	rnex 5052	. . . 4 |- ran { x } e. _V
4	3	uniex 4585	. . 3 |- U. ran { x } e. _V
5		df-2nd 6379	. . 3 |- 2nd = ( x e. _V |-> U. ran { x } )
6	4, 5	fnmpti 5515	. 2 |- 2nd Fn _V
7	5	rnmpt 5032	. . 3 |- ran 2nd = { y | E. x e. _V y = U. ran { x } }
8		vex 2824	. . . . 5 |- y e. _V
9	8, 8	opex 4371	. . . . . 6 |- <. y , y >. e. _V
10	8, 8	op2nda 5275	. . . . . . 7 |- U. ran { <. y , y >. } = y
11	10	eqcomi 2242	. . . . . 6 |- y = U. ran { <. y , y >. }
12		sneq 3720	. . . . . . . . . 10 |- ( x = <. y , y >. -> { x } = { <. y , y >. } )
13	12	rneqd 5013	. . . . . . . . 9 |- ( x = <. y , y >. -> ran { x } = ran { <. y , y >. } )
14	13	unieqd 3946	. . . . . . . 8 |- ( x = <. y , y >. -> U. ran { x } = U. ran { <. y , y >. } )
15	14	eqeq2d 2250	. . . . . . 7 |- ( x = <. y , y >. -> ( y = U. ran { x } <-> y = U. ran { <. y , y >. } ) )
16	15	rspcev 2929	. . . . . 6 |- ( ( <. y , y >. e. _V /\ y = U. ran { <. y , y >. } ) -> E. x e. _V y = U. ran { x } )
17	9, 11, 16	mp2an 430	. . . . 5 |- E. x e. _V y = U. ran { x }
18	8, 17	2th 174	. . . 4 |- ( y e. _V <-> E. x e. _V y = U. ran { x } )
19	18	abbi2i 2353	. . 3 |- _V = { y | E. x e. _V y = U. ran { x } }
20	7, 19	eqtr4i 2262	. 2 |- ran 2nd = _V
21		df-fo 5386	. 2 |- ( 2nd : _V -onto-> _V <-> ( 2nd Fn _V /\ ran 2nd = _V ) )
22	6, 20, 21	mpbir2an 955	1 |- 2nd : _V -onto-> _V

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   ran crn 4777   Fn wfn 5375   -onto->wfo 5378   2ndc2nd 6377

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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580

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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-fun 5382  df-fn 5383  df-fo 5386  df-2nd 6379

This theorem is used by:  2ndcof  6402  2ndexg  6406  df2nd2  6460  2ndconst  6462  suplocexprlemmu  8091  suplocexprlemdisj  8093  suplocexprlemloc  8094  suplocexprlemub  8096  gsum2dfilem2  14272  upxp  15498  uptx  15500  cnmpt2nd  15515