Theorem ixpsnf1o 6630

Description: A bijection between a class and single-point functions to it. (Contributed by Stefan O'Rear, 24-Jan-2015.)

Hypothesis

Ref	Expression
ixpsnf1o.f	|- F = ( x e. A |-> ( { I } X. { x } ) )

Assertion

Ref	Expression
ixpsnf1o	|- ( I e. V -> F : A -1-1-onto-> X_ y e. { I } A )

Distinct variable groups:   x, I, y   x, A, y   x, V, y   y, F

Allowed substitution hint:   F( x)

Proof of Theorem ixpsnf1o

Dummy variables a b c are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ixpsnf1o.f	. 2 |- F = ( x e. A |-> ( { I } X. { x } ) )
2		snexg 4108	. . . 4 |- ( I e. V -> { I } e. _V )
3		vex 2689	. . . . 5 |- x e. _V
4	3	snex 4109	. . . 4 |- { x } e. _V
5		xpexg 4653	. . . 4 |- ( ( { I } e. _V /\ { x } e. _V ) -> ( { I } X. { x } ) e. _V )
6	2, 4, 5	sylancl 409	. . 3 |- ( I e. V -> ( { I } X. { x } ) e. _V )
7	6	adantr 274	. 2 |- ( ( I e. V /\ x e. A ) -> ( { I } X. { x } ) e. _V )
8		vex 2689	. . . . 5 |- a e. _V
9	8	rnex 4806	. . . 4 |- ran a e. _V
10	9	uniex 4359	. . 3 |- U. ran a e. _V
11	10	a1i 9	. 2 |- ( ( I e. V /\ a e. X_ y e. { I } A ) -> U. ran a e. _V )
12		sneq 3538	. . . . . 6 |- ( b = I -> { b } = { I } )
13	12	xpeq1d 4562	. . . . 5 |- ( b = I -> ( { b } X. { x } ) = ( { I } X. { x } ) )
14	13	eqeq2d 2151	. . . 4 |- ( b = I -> ( a = ( { b } X. { x } ) <-> a = ( { I } X. { x } ) ) )
15	14	anbi2d 459	. . 3 |- ( b = I -> ( ( x e. A /\ a = ( { b } X. { x } ) ) <-> ( x e. A /\ a = ( { I } X. { x } ) ) ) )
16		elixpsn 6629	. . . . . 6 |- ( b e. _V -> ( a e. X_ y e. { b } A <-> E. c e. A a = { <. b , c >. } ) )
17	16	elv 2690	. . . . 5 |- ( a e. X_ y e. { b } A <-> E. c e. A a = { <. b , c >. } )
18	12	ixpeq1d 6604	. . . . . 6 |- ( b = I -> X_ y e. { b } A = X_ y e. { I } A )
19	18	eleq2d 2209	. . . . 5 |- ( b = I -> ( a e. X_ y e. { b } A <-> a e. X_ y e. { I } A ) )
20	17, 19	syl5bbr 193	. . . 4 |- ( b = I -> ( E. c e. A a = { <. b , c >. } <-> a e. X_ y e. { I } A ) )
21	20	anbi1d 460	. . 3 |- ( b = I -> ( ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) <-> ( a e. X_ y e. { I } A /\ x = U. ran a ) ) )
22		vex 2689	. . . . . . 7 |- b e. _V
23	22, 3	xpsn 5596	. . . . . 6 |- ( { b } X. { x } ) = { <. b , x >. }
24	23	eqeq2i 2150	. . . . 5 |- ( a = ( { b } X. { x } ) <-> a = { <. b , x >. } )
25	24	anbi2i 452	. . . 4 |- ( ( x e. A /\ a = ( { b } X. { x } ) ) <-> ( x e. A /\ a = { <. b , x >. } ) )
26		eqid 2139	. . . . . . . . 9 |- { <. b , x >. } = { <. b , x >. }
27		opeq2 3706	. . . . . . . . . . 11 |- ( c = x -> <. b , c >. = <. b , x >. )
28	27	sneqd 3540	. . . . . . . . . 10 |- ( c = x -> { <. b , c >. } = { <. b , x >. } )
29	28	rspceeqv 2807	. . . . . . . . 9 |- ( ( x e. A /\ { <. b , x >. } = { <. b , x >. } ) -> E. c e. A { <. b , x >. } = { <. b , c >. } )
30	26, 29	mpan2 421	. . . . . . . 8 |- ( x e. A -> E. c e. A { <. b , x >. } = { <. b , c >. } )
31	22, 3	op2nda 5023	. . . . . . . . 9 |- U. ran { <. b , x >. } = x
32	31	eqcomi 2143	. . . . . . . 8 |- x = U. ran { <. b , x >. }
33	30, 32	jctir 311	. . . . . . 7 |- ( x e. A -> ( E. c e. A { <. b , x >. } = { <. b , c >. } /\ x = U. ran { <. b , x >. } ) )
34		eqeq1 2146	. . . . . . . . 9 |- ( a = { <. b , x >. } -> ( a = { <. b , c >. } <-> { <. b , x >. } = { <. b , c >. } ) )
35	34	rexbidv 2438	. . . . . . . 8 |- ( a = { <. b , x >. } -> ( E. c e. A a = { <. b , c >. } <-> E. c e. A { <. b , x >. } = { <. b , c >. } ) )
36		rneq 4766	. . . . . . . . . 10 |- ( a = { <. b , x >. } -> ran a = ran { <. b , x >. } )
37	36	unieqd 3747	. . . . . . . . 9 |- ( a = { <. b , x >. } -> U. ran a = U. ran { <. b , x >. } )
38	37	eqeq2d 2151	. . . . . . . 8 |- ( a = { <. b , x >. } -> ( x = U. ran a <-> x = U. ran { <. b , x >. } ) )
39	35, 38	anbi12d 464	. . . . . . 7 |- ( a = { <. b , x >. } -> ( ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) <-> ( E. c e. A { <. b , x >. } = { <. b , c >. } /\ x = U. ran { <. b , x >. } ) ) )
40	33, 39	syl5ibrcom 156	. . . . . 6 |- ( x e. A -> ( a = { <. b , x >. } -> ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) ) )
41	40	imp 123	. . . . 5 |- ( ( x e. A /\ a = { <. b , x >. } ) -> ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) )
42		vex 2689	. . . . . . . . . . 11 |- c e. _V
43	22, 42	op2nda 5023	. . . . . . . . . 10 |- U. ran { <. b , c >. } = c
44	43	eqeq2i 2150	. . . . . . . . 9 |- ( x = U. ran { <. b , c >. } <-> x = c )
45		eqidd 2140	. . . . . . . . . . 11 |- ( c e. A -> { <. b , c >. } = { <. b , c >. } )
46	45	ancli 321	. . . . . . . . . 10 |- ( c e. A -> ( c e. A /\ { <. b , c >. } = { <. b , c >. } ) )
47		eleq1w 2200	. . . . . . . . . . 11 |- ( x = c -> ( x e. A <-> c e. A ) )
48		opeq2 3706	. . . . . . . . . . . . 13 |- ( x = c -> <. b , x >. = <. b , c >. )
49	48	sneqd 3540	. . . . . . . . . . . 12 |- ( x = c -> { <. b , x >. } = { <. b , c >. } )
50	49	eqeq2d 2151	. . . . . . . . . . 11 |- ( x = c -> ( { <. b , c >. } = { <. b , x >. } <-> { <. b , c >. } = { <. b , c >. } ) )
51	47, 50	anbi12d 464	. . . . . . . . . 10 |- ( x = c -> ( ( x e. A /\ { <. b , c >. } = { <. b , x >. } ) <-> ( c e. A /\ { <. b , c >. } = { <. b , c >. } ) ) )
52	46, 51	syl5ibrcom 156	. . . . . . . . 9 |- ( c e. A -> ( x = c -> ( x e. A /\ { <. b , c >. } = { <. b , x >. } ) ) )
53	44, 52	syl5bi 151	. . . . . . . 8 |- ( c e. A -> ( x = U. ran { <. b , c >. } -> ( x e. A /\ { <. b , c >. } = { <. b , x >. } ) ) )
54		rneq 4766	. . . . . . . . . . 11 |- ( a = { <. b , c >. } -> ran a = ran { <. b , c >. } )
55	54	unieqd 3747	. . . . . . . . . 10 |- ( a = { <. b , c >. } -> U. ran a = U. ran { <. b , c >. } )
56	55	eqeq2d 2151	. . . . . . . . 9 |- ( a = { <. b , c >. } -> ( x = U. ran a <-> x = U. ran { <. b , c >. } ) )
57		eqeq1 2146	. . . . . . . . . 10 |- ( a = { <. b , c >. } -> ( a = { <. b , x >. } <-> { <. b , c >. } = { <. b , x >. } ) )
58	57	anbi2d 459	. . . . . . . . 9 |- ( a = { <. b , c >. } -> ( ( x e. A /\ a = { <. b , x >. } ) <-> ( x e. A /\ { <. b , c >. } = { <. b , x >. } ) ) )
59	56, 58	imbi12d 233	. . . . . . . 8 |- ( a = { <. b , c >. } -> ( ( x = U. ran a -> ( x e. A /\ a = { <. b , x >. } ) ) <-> ( x = U. ran { <. b , c >. } -> ( x e. A /\ { <. b , c >. } = { <. b , x >. } ) ) ) )
60	53, 59	syl5ibrcom 156	. . . . . . 7 |- ( c e. A -> ( a = { <. b , c >. } -> ( x = U. ran a -> ( x e. A /\ a = { <. b , x >. } ) ) ) )
61	60	rexlimiv 2543	. . . . . 6 |- ( E. c e. A a = { <. b , c >. } -> ( x = U. ran a -> ( x e. A /\ a = { <. b , x >. } ) ) )
62	61	imp 123	. . . . 5 |- ( ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) -> ( x e. A /\ a = { <. b , x >. } ) )
63	41, 62	impbii 125	. . . 4 |- ( ( x e. A /\ a = { <. b , x >. } ) <-> ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) )
64	25, 63	bitri 183	. . 3 |- ( ( x e. A /\ a = ( { b } X. { x } ) ) <-> ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) )
65	15, 21, 64	vtoclbg 2747	. 2 |- ( I e. V -> ( ( x e. A /\ a = ( { I } X. { x } ) ) <-> ( a e. X_ y e. { I } A /\ x = U. ran a ) ) )
66	1, 7, 11, 65	f1od 5973	1 |- ( I e. V -> F : A -1-1-onto-> X_ y e. { I } A )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1331   e. wcel 1480   E.wrex 2417   _Vcvv 2686   {csn 3527   <.cop 3530   U.cuni 3736   |-> cmpt 3989   X. cxp 4537   ran crn 4540   -1-1-onto->wf1o 5122   X_cixp 6592

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-reu 2423  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ixp 6593

This theorem is referenced by:  mapsnf1o  6631