Theorem ixpsnf1o 6792

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 4214	. . . 4 |- ( I e. V -> { I } e. _V )
3		vex 2763	. . . . 5 |- x e. _V
4	3	snex 4215	. . . 4 |- { x } e. _V
5		xpexg 4774	. . . 4 |- ( ( { I } e. _V /\ { x } e. _V ) -> ( { I } X. { x } ) e. _V )
6	2, 4, 5	sylancl 413	. . 3 |- ( I e. V -> ( { I } X. { x } ) e. _V )
7	6	adantr 276	. 2 |- ( ( I e. V /\ x e. A ) -> ( { I } X. { x } ) e. _V )
8		vex 2763	. . . . 5 |- a e. _V
9	8	rnex 4930	. . . 4 |- ran a e. _V
10	9	uniex 4469	. . 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 3630	. . . . . 6 |- ( b = I -> { b } = { I } )
13	12	xpeq1d 4683	. . . . 5 |- ( b = I -> ( { b } X. { x } ) = ( { I } X. { x } ) )
14	13	eqeq2d 2205	. . . 4 |- ( b = I -> ( a = ( { b } X. { x } ) <-> a = ( { I } X. { x } ) ) )
15	14	anbi2d 464	. . 3 |- ( b = I -> ( ( x e. A /\ a = ( { b } X. { x } ) ) <-> ( x e. A /\ a = ( { I } X. { x } ) ) ) )
16		elixpsn 6791	. . . . . 6 |- ( b e. _V -> ( a e. X_ y e. { b } A <-> E. c e. A a = { <. b , c >. } ) )
17	16	elv 2764	. . . . 5 |- ( a e. X_ y e. { b } A <-> E. c e. A a = { <. b , c >. } )
18	12	ixpeq1d 6766	. . . . . 6 |- ( b = I -> X_ y e. { b } A = X_ y e. { I } A )
19	18	eleq2d 2263	. . . . 5 |- ( b = I -> ( a e. X_ y e. { b } A <-> a e. X_ y e. { I } A ) )
20	17, 19	bitr3id 194	. . . 4 |- ( b = I -> ( E. c e. A a = { <. b , c >. } <-> a e. X_ y e. { I } A ) )
21	20	anbi1d 465	. . 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 2763	. . . . . . 7 |- b e. _V
23	22, 3	xpsn 5735	. . . . . 6 |- ( { b } X. { x } ) = { <. b , x >. }
24	23	eqeq2i 2204	. . . . 5 |- ( a = ( { b } X. { x } ) <-> a = { <. b , x >. } )
25	24	anbi2i 457	. . . 4 |- ( ( x e. A /\ a = ( { b } X. { x } ) ) <-> ( x e. A /\ a = { <. b , x >. } ) )
26		eqid 2193	. . . . . . . . 9 |- { <. b , x >. } = { <. b , x >. }
27		opeq2 3806	. . . . . . . . . . 11 |- ( c = x -> <. b , c >. = <. b , x >. )
28	27	sneqd 3632	. . . . . . . . . 10 |- ( c = x -> { <. b , c >. } = { <. b , x >. } )
29	28	rspceeqv 2883	. . . . . . . . 9 |- ( ( x e. A /\ { <. b , x >. } = { <. b , x >. } ) -> E. c e. A { <. b , x >. } = { <. b , c >. } )
30	26, 29	mpan2 425	. . . . . . . 8 |- ( x e. A -> E. c e. A { <. b , x >. } = { <. b , c >. } )
31	22, 3	op2nda 5151	. . . . . . . . 9 |- U. ran { <. b , x >. } = x
32	31	eqcomi 2197	. . . . . . . 8 |- x = U. ran { <. b , x >. }
33	30, 32	jctir 313	. . . . . . 7 |- ( x e. A -> ( E. c e. A { <. b , x >. } = { <. b , c >. } /\ x = U. ran { <. b , x >. } ) )
34		eqeq1 2200	. . . . . . . . 9 |- ( a = { <. b , x >. } -> ( a = { <. b , c >. } <-> { <. b , x >. } = { <. b , c >. } ) )
35	34	rexbidv 2495	. . . . . . . 8 |- ( a = { <. b , x >. } -> ( E. c e. A a = { <. b , c >. } <-> E. c e. A { <. b , x >. } = { <. b , c >. } ) )
36		rneq 4890	. . . . . . . . . 10 |- ( a = { <. b , x >. } -> ran a = ran { <. b , x >. } )
37	36	unieqd 3847	. . . . . . . . 9 |- ( a = { <. b , x >. } -> U. ran a = U. ran { <. b , x >. } )
38	37	eqeq2d 2205	. . . . . . . 8 |- ( a = { <. b , x >. } -> ( x = U. ran a <-> x = U. ran { <. b , x >. } ) )
39	35, 38	anbi12d 473	. . . . . . 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 157	. . . . . 6 |- ( x e. A -> ( a = { <. b , x >. } -> ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) ) )
41	40	imp 124	. . . . 5 |- ( ( x e. A /\ a = { <. b , x >. } ) -> ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) )
42		vex 2763	. . . . . . . . . . 11 |- c e. _V
43	22, 42	op2nda 5151	. . . . . . . . . 10 |- U. ran { <. b , c >. } = c
44	43	eqeq2i 2204	. . . . . . . . 9 |- ( x = U. ran { <. b , c >. } <-> x = c )
45		eqidd 2194	. . . . . . . . . . 11 |- ( c e. A -> { <. b , c >. } = { <. b , c >. } )
46	45	ancli 323	. . . . . . . . . 10 |- ( c e. A -> ( c e. A /\ { <. b , c >. } = { <. b , c >. } ) )
47		eleq1w 2254	. . . . . . . . . . 11 |- ( x = c -> ( x e. A <-> c e. A ) )
48		opeq2 3806	. . . . . . . . . . . . 13 |- ( x = c -> <. b , x >. = <. b , c >. )
49	48	sneqd 3632	. . . . . . . . . . . 12 |- ( x = c -> { <. b , x >. } = { <. b , c >. } )
50	49	eqeq2d 2205	. . . . . . . . . . 11 |- ( x = c -> ( { <. b , c >. } = { <. b , x >. } <-> { <. b , c >. } = { <. b , c >. } ) )
51	47, 50	anbi12d 473	. . . . . . . . . 10 |- ( x = c -> ( ( x e. A /\ { <. b , c >. } = { <. b , x >. } ) <-> ( c e. A /\ { <. b , c >. } = { <. b , c >. } ) ) )
52	46, 51	syl5ibrcom 157	. . . . . . . . 9 |- ( c e. A -> ( x = c -> ( x e. A /\ { <. b , c >. } = { <. b , x >. } ) ) )
53	44, 52	biimtrid 152	. . . . . . . 8 |- ( c e. A -> ( x = U. ran { <. b , c >. } -> ( x e. A /\ { <. b , c >. } = { <. b , x >. } ) ) )
54		rneq 4890	. . . . . . . . . . 11 |- ( a = { <. b , c >. } -> ran a = ran { <. b , c >. } )
55	54	unieqd 3847	. . . . . . . . . 10 |- ( a = { <. b , c >. } -> U. ran a = U. ran { <. b , c >. } )
56	55	eqeq2d 2205	. . . . . . . . 9 |- ( a = { <. b , c >. } -> ( x = U. ran a <-> x = U. ran { <. b , c >. } ) )
57		eqeq1 2200	. . . . . . . . . 10 |- ( a = { <. b , c >. } -> ( a = { <. b , x >. } <-> { <. b , c >. } = { <. b , x >. } ) )
58	57	anbi2d 464	. . . . . . . . 9 |- ( a = { <. b , c >. } -> ( ( x e. A /\ a = { <. b , x >. } ) <-> ( x e. A /\ { <. b , c >. } = { <. b , x >. } ) ) )
59	56, 58	imbi12d 234	. . . . . . . 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 157	. . . . . . 7 |- ( c e. A -> ( a = { <. b , c >. } -> ( x = U. ran a -> ( x e. A /\ a = { <. b , x >. } ) ) ) )
61	60	rexlimiv 2605	. . . . . 6 |- ( E. c e. A a = { <. b , c >. } -> ( x = U. ran a -> ( x e. A /\ a = { <. b , x >. } ) ) )
62	61	imp 124	. . . . 5 |- ( ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) -> ( x e. A /\ a = { <. b , x >. } ) )
63	41, 62	impbii 126	. . . 4 |- ( ( x e. A /\ a = { <. b , x >. } ) <-> ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) )
64	25, 63	bitri 184	. . 3 |- ( ( x e. A /\ a = ( { b } X. { x } ) ) <-> ( E. c e. A a = { <. b , c >. } /\ x = U. ran a ) )
65	15, 21, 64	vtoclbg 2822	. 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 6123	1 |- ( I e. V -> F : A -1-1-onto-> X_ y e. { I } A )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2164   E.wrex 2473   _Vcvv 2760   {csn 3619   <.cop 3622   U.cuni 3836   |-> cmpt 4091   X. cxp 4658   ran crn 4661   -1-1-onto->wf1o 5254   X_cixp 6754

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-v 2762  df-sbc 2987  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ixp 6755

This theorem is referenced by:  mapsnf1o  6793