Theorem ssmapsn 41845

Description: A subset 𝐶 of a set exponentiation to a singleton, is its projection 𝐷 exponentiated to the singleton. (Contributed by Glauco Siliprandi, 3-Mar-2021.)

Hypotheses

Ref	Expression
ssmapsn.f	⊢ Ⅎ𝑓𝐷
ssmapsn.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
ssmapsn.c	⊢ (𝜑 → 𝐶 ⊆ (𝐵 ↑m {𝐴}))
ssmapsn.d	⊢ 𝐷 = ∪ 𝑓 ∈ 𝐶 ran 𝑓

Assertion

Ref	Expression
ssmapsn	⊢ (𝜑 → 𝐶 = (𝐷 ↑m {𝐴}))

Distinct variable groups:   𝐴,𝑓   𝐶,𝑓   𝜑,𝑓

Allowed substitution hints:   𝐵(𝑓)   𝐷(𝑓)   𝑉(𝑓)

Proof of Theorem ssmapsn

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssmapsn.c	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ⊆ (𝐵 ↑m {𝐴}))
2	1	sselda 3915	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑓 ∈ (𝐵 ↑m {𝐴}))
3		elmapi 8411	. . . . . . . 8 ⊢ (𝑓 ∈ (𝐵 ↑m {𝐴}) → 𝑓:{𝐴}⟶𝐵)
4	2, 3	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑓:{𝐴}⟶𝐵)
5	4	ffnd 6488	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑓 Fn {𝐴})
6		ssmapsn.d	. . . . . . . . 9 ⊢ 𝐷 = ∪ 𝑓 ∈ 𝐶 ran 𝑓
7	6	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 𝐷 = ∪ 𝑓 ∈ 𝐶 ran 𝑓)
8		ovexd 7170	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 ↑m {𝐴}) ∈ V)
9	8, 1	ssexd 5192	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ V)
10		rnexg 7595	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ 𝐶 → ran 𝑓 ∈ V)
11	10	rgen 3116	. . . . . . . . . . 11 ⊢ ∀𝑓 ∈ 𝐶 ran 𝑓 ∈ V
12	11	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑓 ∈ 𝐶 ran 𝑓 ∈ V)
13	9, 12	jca 515	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ V ∧ ∀𝑓 ∈ 𝐶 ran 𝑓 ∈ V))
14		iunexg 7646	. . . . . . . . 9 ⊢ ((𝐶 ∈ V ∧ ∀𝑓 ∈ 𝐶 ran 𝑓 ∈ V) → ∪ 𝑓 ∈ 𝐶 ran 𝑓 ∈ V)
15	13, 14	syl 17	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝑓 ∈ 𝐶 ran 𝑓 ∈ V)
16	7, 15	eqeltrd 2890	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ V)
17	16	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝐷 ∈ V)
18		ssiun2 4934	. . . . . . . . 9 ⊢ (𝑓 ∈ 𝐶 → ran 𝑓 ⊆ ∪ 𝑓 ∈ 𝐶 ran 𝑓)
19	18	adantl 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → ran 𝑓 ⊆ ∪ 𝑓 ∈ 𝐶 ran 𝑓)
20		ssmapsn.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
21		snidg 4559	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
22	20, 21	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ {𝐴})
23	22	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝐴 ∈ {𝐴})
24		fnfvelrn 6825	. . . . . . . . 9 ⊢ ((𝑓 Fn {𝐴} ∧ 𝐴 ∈ {𝐴}) → (𝑓‘𝐴) ∈ ran 𝑓)
25	5, 23, 24	syl2anc 587	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → (𝑓‘𝐴) ∈ ran 𝑓)
26	19, 25	sseldd 3916	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → (𝑓‘𝐴) ∈ ∪ 𝑓 ∈ 𝐶 ran 𝑓)
27	26, 6	eleqtrrdi 2901	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → (𝑓‘𝐴) ∈ 𝐷)
28	5, 17, 27	elmapsnd 41833	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑓 ∈ (𝐷 ↑m {𝐴}))
29	28	ex 416	. . . 4 ⊢ (𝜑 → (𝑓 ∈ 𝐶 → 𝑓 ∈ (𝐷 ↑m {𝐴})))
30	16	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → 𝐷 ∈ V)
31		snex 5297	. . . . . . . . . 10 ⊢ {𝐴} ∈ V
32	31	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → {𝐴} ∈ V)
33		simpr 488	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → 𝑓 ∈ (𝐷 ↑m {𝐴}))
34	22	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → 𝐴 ∈ {𝐴})
35	30, 32, 33, 34	fvmap 41826	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → (𝑓‘𝐴) ∈ 𝐷)
36	6	idi 1	. . . . . . . . 9 ⊢ 𝐷 = ∪ 𝑓 ∈ 𝐶 ran 𝑓
37		rneq 5770	. . . . . . . . . 10 ⊢ (𝑓 = 𝑔 → ran 𝑓 = ran 𝑔)
38	37	cbviunv 4927	. . . . . . . . 9 ⊢ ∪ 𝑓 ∈ 𝐶 ran 𝑓 = ∪ 𝑔 ∈ 𝐶 ran 𝑔
39	36, 38	eqtri 2821	. . . . . . . 8 ⊢ 𝐷 = ∪ 𝑔 ∈ 𝐶 ran 𝑔
40	35, 39	eleqtrdi 2900	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → (𝑓‘𝐴) ∈ ∪ 𝑔 ∈ 𝐶 ran 𝑔)
41		eliun 4885	. . . . . . 7 ⊢ ((𝑓‘𝐴) ∈ ∪ 𝑔 ∈ 𝐶 ran 𝑔 ↔ ∃𝑔 ∈ 𝐶 (𝑓‘𝐴) ∈ ran 𝑔)
42	40, 41	sylib 221	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → ∃𝑔 ∈ 𝐶 (𝑓‘𝐴) ∈ ran 𝑔)
43		simp3 1135	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → (𝑓‘𝐴) ∈ ran 𝑔)
44		simp1l 1194	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝜑)
45	44, 20	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝐴 ∈ 𝑉)
46		eqid 2798	. . . . . . . . . . 11 ⊢ {𝐴} = {𝐴}
47		simp1r 1195	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑓 ∈ (𝐷 ↑m {𝐴}))
48		elmapfn 8412	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ (𝐷 ↑m {𝐴}) → 𝑓 Fn {𝐴})
49	47, 48	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑓 Fn {𝐴})
50	1	sselda 3915	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐶) → 𝑔 ∈ (𝐵 ↑m {𝐴}))
51		elmapfn 8412	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ (𝐵 ↑m {𝐴}) → 𝑔 Fn {𝐴})
52	50, 51	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐶) → 𝑔 Fn {𝐴})
53	52	3adant3 1129	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑔 Fn {𝐴})
54	53	3adant1r 1174	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑔 Fn {𝐴})
55	45, 46, 49, 54	fsneqrn 41840	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → (𝑓 = 𝑔 ↔ (𝑓‘𝐴) ∈ ran 𝑔))
56	43, 55	mpbird 260	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑓 = 𝑔)
57		simp2 1134	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑔 ∈ 𝐶)
58	56, 57	eqeltrd 2890	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑓 ∈ 𝐶)
59	58	3exp 1116	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → (𝑔 ∈ 𝐶 → ((𝑓‘𝐴) ∈ ran 𝑔 → 𝑓 ∈ 𝐶)))
60	59	rexlimdv 3242	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → (∃𝑔 ∈ 𝐶 (𝑓‘𝐴) ∈ ran 𝑔 → 𝑓 ∈ 𝐶))
61	42, 60	mpd 15	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → 𝑓 ∈ 𝐶)
62	61	ex 416	. . . 4 ⊢ (𝜑 → (𝑓 ∈ (𝐷 ↑m {𝐴}) → 𝑓 ∈ 𝐶))
63	29, 62	impbid 215	. . 3 ⊢ (𝜑 → (𝑓 ∈ 𝐶 ↔ 𝑓 ∈ (𝐷 ↑m {𝐴})))
64	63	alrimiv 1928	. 2 ⊢ (𝜑 → ∀𝑓(𝑓 ∈ 𝐶 ↔ 𝑓 ∈ (𝐷 ↑m {𝐴})))
65		nfcv 2955	. . 3 ⊢ Ⅎ𝑓𝐶
66		ssmapsn.f	. . . 4 ⊢ Ⅎ𝑓𝐷
67		nfcv 2955	. . . 4 ⊢ Ⅎ𝑓 ↑m
68		nfcv 2955	. . . 4 ⊢ Ⅎ𝑓{𝐴}
69	66, 67, 68	nfov 7165	. . 3 ⊢ Ⅎ𝑓(𝐷 ↑m {𝐴})
70	65, 69	cleqf 2983	. 2 ⊢ (𝐶 = (𝐷 ↑m {𝐴}) ↔ ∀𝑓(𝑓 ∈ 𝐶 ↔ 𝑓 ∈ (𝐷 ↑m {𝐴})))
71	64, 70	sylibr 237	1 ⊢ (𝜑 → 𝐶 = (𝐷 ↑m {𝐴}))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084  ∀wal 1536   = wceq 1538   ∈ wcel 2111  Ⅎwnfc 2936  ∀wral 3106  ∃wrex 3107  Vcvv 3441   ⊆ wss 3881  {csn 4525  ∪ ciun 4881  ran crn 5520   Fn wfn 6319  ⟶wf 6320  ‘cfv 6324  (class class class)co 7135   ↑_m cmap 8389

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1st 7671  df-2nd 7672  df-map 8391

This theorem is referenced by:  vonvolmbllem  43299  vonvolmbl2  43302  vonvol2  43303