Theorem mptsnunlem 32361

Description: This is the core of the proof of mptsnun 32362, but to avoid the distinct variables on the definitions, we split this proof into two. (Contributed by ML, 16-Jul-2020.)

Hypotheses

Ref	Expression
mptsnun.f	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ {𝑥})
mptsnun.r	⊢ 𝑅 = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}

Assertion

Ref	Expression
mptsnunlem	⊢ (𝐵 ⊆ 𝐴 → 𝐵 = ∪ (𝐹 “ 𝐵))

Distinct variable groups:   𝑢,𝐴,𝑥   𝑢,𝐵,𝑥   𝑥,𝐹

Allowed substitution hints:   𝑅(𝑥,𝑢)   𝐹(𝑢)

Proof of Theorem mptsnunlem

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ima 5051	. . . . . . 7 ⊢ (𝐹 “ 𝐵) = ran (𝐹 ↾ 𝐵)
2		mptsnun.f	. . . . . . . . . . 11 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ {𝑥})
3	2	reseq1i 5313	. . . . . . . . . 10 ⊢ (𝐹 ↾ 𝐵) = ((𝑥 ∈ 𝐴 ↦ {𝑥}) ↾ 𝐵)
4		resmpt 5369	. . . . . . . . . 10 ⊢ (𝐵 ⊆ 𝐴 → ((𝑥 ∈ 𝐴 ↦ {𝑥}) ↾ 𝐵) = (𝑥 ∈ 𝐵 ↦ {𝑥}))
5	3, 4	syl5eq 2656	. . . . . . . . 9 ⊢ (𝐵 ⊆ 𝐴 → (𝐹 ↾ 𝐵) = (𝑥 ∈ 𝐵 ↦ {𝑥}))
6	5	rneqd 5274	. . . . . . . 8 ⊢ (𝐵 ⊆ 𝐴 → ran (𝐹 ↾ 𝐵) = ran (𝑥 ∈ 𝐵 ↦ {𝑥}))
7		rnmptsn 32358	. . . . . . . 8 ⊢ ran (𝑥 ∈ 𝐵 ↦ {𝑥}) = {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}
8	6, 7	syl6eq 2660	. . . . . . 7 ⊢ (𝐵 ⊆ 𝐴 → ran (𝐹 ↾ 𝐵) = {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})
9	1, 8	syl5eq 2656	. . . . . 6 ⊢ (𝐵 ⊆ 𝐴 → (𝐹 “ 𝐵) = {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})
10	9	unieqd 4382	. . . . 5 ⊢ (𝐵 ⊆ 𝐴 → ∪ (𝐹 “ 𝐵) = ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})
11	10	eleq2d 2673	. . . 4 ⊢ (𝐵 ⊆ 𝐴 → (𝑥 ∈ ∪ (𝐹 “ 𝐵) ↔ 𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
12		eleq1 2676	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
13		eluniab 4383	. . . . . . . . 9 ⊢ (𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}} ↔ ∃𝑢(𝑧 ∈ 𝑢 ∧ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}))
14		ancom 465	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝑢 ∧ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}) ↔ (∃𝑥 ∈ 𝐵 𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢))
15		r19.41v 3070	. . . . . . . . . . . . 13 ⊢ (∃𝑥 ∈ 𝐵 (𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢) ↔ (∃𝑥 ∈ 𝐵 𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢))
16		df-rex 2902	. . . . . . . . . . . . 13 ⊢ (∃𝑥 ∈ 𝐵 (𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢) ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ (𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢)))
17	14, 15, 16	3bitr2i 287	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ 𝑢 ∧ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}) ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ (𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢)))
18		eleq2 2677	. . . . . . . . . . . . . . . . 17 ⊢ (𝑢 = {𝑥} → (𝑧 ∈ 𝑢 ↔ 𝑧 ∈ {𝑥}))
19	18	anbi2d 736	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 = {𝑥} → ((𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢) ↔ (𝑢 = {𝑥} ∧ 𝑧 ∈ {𝑥})))
20	19	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢) → ((𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢) ↔ (𝑢 = {𝑥} ∧ 𝑧 ∈ {𝑥})))
21	20	ibi 255	. . . . . . . . . . . . . 14 ⊢ ((𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢) → (𝑢 = {𝑥} ∧ 𝑧 ∈ {𝑥}))
22	21	anim2i 591	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐵 ∧ (𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢)) → (𝑥 ∈ 𝐵 ∧ (𝑢 = {𝑥} ∧ 𝑧 ∈ {𝑥})))
23	22	eximi 1752	. . . . . . . . . . . 12 ⊢ (∃𝑥(𝑥 ∈ 𝐵 ∧ (𝑢 = {𝑥} ∧ 𝑧 ∈ 𝑢)) → ∃𝑥(𝑥 ∈ 𝐵 ∧ (𝑢 = {𝑥} ∧ 𝑧 ∈ {𝑥})))
24	17, 23	sylbi 206	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑢 ∧ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}) → ∃𝑥(𝑥 ∈ 𝐵 ∧ (𝑢 = {𝑥} ∧ 𝑧 ∈ {𝑥})))
25		an12 834	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐵 ∧ (𝑢 = {𝑥} ∧ 𝑧 ∈ {𝑥})) ↔ (𝑢 = {𝑥} ∧ (𝑥 ∈ 𝐵 ∧ 𝑧 ∈ {𝑥})))
26	25	exbii 1764	. . . . . . . . . . . 12 ⊢ (∃𝑥(𝑥 ∈ 𝐵 ∧ (𝑢 = {𝑥} ∧ 𝑧 ∈ {𝑥})) ↔ ∃𝑥(𝑢 = {𝑥} ∧ (𝑥 ∈ 𝐵 ∧ 𝑧 ∈ {𝑥})))
27		exsimpr 1784	. . . . . . . . . . . 12 ⊢ (∃𝑥(𝑢 = {𝑥} ∧ (𝑥 ∈ 𝐵 ∧ 𝑧 ∈ {𝑥})) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ {𝑥}))
28	26, 27	sylbi 206	. . . . . . . . . . 11 ⊢ (∃𝑥(𝑥 ∈ 𝐵 ∧ (𝑢 = {𝑥} ∧ 𝑧 ∈ {𝑥})) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ {𝑥}))
29	24, 28	syl 17	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝑢 ∧ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ {𝑥}))
30	29	exlimiv 1845	. . . . . . . . 9 ⊢ (∃𝑢(𝑧 ∈ 𝑢 ∧ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ {𝑥}))
31	13, 30	sylbi 206	. . . . . . . 8 ⊢ (𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}} → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ {𝑥}))
32		velsn 4141	. . . . . . . . . 10 ⊢ (𝑧 ∈ {𝑥} ↔ 𝑧 = 𝑥)
33	32	anbi2i 726	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑧 ∈ {𝑥}) ↔ (𝑥 ∈ 𝐵 ∧ 𝑧 = 𝑥))
34	33	exbii 1764	. . . . . . . 8 ⊢ (∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ {𝑥}) ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 = 𝑥))
35	31, 34	sylib 207	. . . . . . 7 ⊢ (𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}} → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 = 𝑥))
36	12	biimparc 503	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑧 = 𝑥) → 𝑧 ∈ 𝐵)
37	36	exlimiv 1845	. . . . . . 7 ⊢ (∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 = 𝑥) → 𝑧 ∈ 𝐵)
38	35, 37	syl 17	. . . . . 6 ⊢ (𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}} → 𝑧 ∈ 𝐵)
39	12, 38	vtoclga 3245	. . . . 5 ⊢ (𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}} → 𝑥 ∈ 𝐵)
40		equid 1926	. . . . . 6 ⊢ 𝑥 = 𝑥
41		eqid 2610	. . . . . . . . . . . 12 ⊢ {𝑥} = {𝑥}
42		snex 4835	. . . . . . . . . . . . . 14 ⊢ {𝑥} ∈ V
43		sbcg 3470	. . . . . . . . . . . . . 14 ⊢ ({𝑥} ∈ V → ([{𝑥} / 𝑢]𝑥 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
44	42, 43	ax-mp 5	. . . . . . . . . . . . 13 ⊢ ([{𝑥} / 𝑢]𝑥 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵)
45		eqsbc3 3442	. . . . . . . . . . . . . 14 ⊢ ({𝑥} ∈ V → ([{𝑥} / 𝑢]𝑢 = {𝑥} ↔ {𝑥} = {𝑥}))
46	42, 45	ax-mp 5	. . . . . . . . . . . . 13 ⊢ ([{𝑥} / 𝑢]𝑢 = {𝑥} ↔ {𝑥} = {𝑥})
47	18	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → (𝑧 ∈ 𝑢 ↔ 𝑧 ∈ {𝑥}))
48		df-rex 2902	. . . . . . . . . . . . . . . . . . . 20 ⊢ (∃𝑥 ∈ 𝐵 𝑢 = {𝑥} ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}))
49	13	biimpri 217	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (∃𝑢(𝑧 ∈ 𝑢 ∧ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}) → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})
50	49	19.23bi 2049	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑧 ∈ 𝑢 ∧ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}) → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})
51	50	expcom 450	. . . . . . . . . . . . . . . . . . . 20 ⊢ (∃𝑥 ∈ 𝐵 𝑢 = {𝑥} → (𝑧 ∈ 𝑢 → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
52	48, 51	sylbir 224	. . . . . . . . . . . . . . . . . . 19 ⊢ (∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → (𝑧 ∈ 𝑢 → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
53	52	19.23bi 2049	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → (𝑧 ∈ 𝑢 → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
54	47, 53	sylbird 249	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → (𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
55	54	sbcth 3417	. . . . . . . . . . . . . . . 16 ⊢ ({𝑥} ∈ V → [{𝑥} / 𝑢]((𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → (𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})))
56	42, 55	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ [{𝑥} / 𝑢]((𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → (𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
57		sbcimg 3444	. . . . . . . . . . . . . . . 16 ⊢ ({𝑥} ∈ V → ([{𝑥} / 𝑢]((𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → (𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})) ↔ ([{𝑥} / 𝑢](𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → [{𝑥} / 𝑢](𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))))
58	42, 57	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ ([{𝑥} / 𝑢]((𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → (𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})) ↔ ([{𝑥} / 𝑢](𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → [{𝑥} / 𝑢](𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})))
59	56, 58	mpbi 219	. . . . . . . . . . . . . 14 ⊢ ([{𝑥} / 𝑢](𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) → [{𝑥} / 𝑢](𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
60		sbcan 3445	. . . . . . . . . . . . . 14 ⊢ ([{𝑥} / 𝑢](𝑥 ∈ 𝐵 ∧ 𝑢 = {𝑥}) ↔ ([{𝑥} / 𝑢]𝑥 ∈ 𝐵 ∧ [{𝑥} / 𝑢]𝑢 = {𝑥}))
61		nfv 1830	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑢 𝑧 ∈ {𝑥}
62		nfab1 2753	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑢{𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}
63	62	nfuni 4378	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑢∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}
64	63	nfcri 2745	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑢 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}
65	61, 64	nfim 1813	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑢(𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})
66		sbctt 3467	. . . . . . . . . . . . . . 15 ⊢ (({𝑥} ∈ V ∧ Ⅎ𝑢(𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})) → ([{𝑥} / 𝑢](𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}) ↔ (𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})))
67	42, 65, 66	mp2an 704	. . . . . . . . . . . . . 14 ⊢ ([{𝑥} / 𝑢](𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}) ↔ (𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
68	59, 60, 67	3imtr3i 279	. . . . . . . . . . . . 13 ⊢ (([{𝑥} / 𝑢]𝑥 ∈ 𝐵 ∧ [{𝑥} / 𝑢]𝑢 = {𝑥}) → (𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
69	44, 46, 68	syl2anbr 496	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐵 ∧ {𝑥} = {𝑥}) → (𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
70	41, 69	mpan2 703	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐵 → (𝑧 ∈ {𝑥} → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
71	32, 70	syl5bir 232	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐵 → (𝑧 = 𝑥 → 𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
72		eleq1 2676	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}} ↔ 𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
73	71, 72	mpbidi 230	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → (𝑧 = 𝑥 → 𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
74	73	com12 32	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → (𝑥 ∈ 𝐵 → 𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
75	74	sbimi 1873	. . . . . . 7 ⊢ ([𝑥 / 𝑧]𝑧 = 𝑥 → [𝑥 / 𝑧](𝑥 ∈ 𝐵 → 𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
76		equsb3 2420	. . . . . . 7 ⊢ ([𝑥 / 𝑧]𝑧 = 𝑥 ↔ 𝑥 = 𝑥)
77		nfv 1830	. . . . . . . 8 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐵 → 𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})
78	77	sbf 2368	. . . . . . 7 ⊢ ([𝑥 / 𝑧](𝑥 ∈ 𝐵 → 𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}) ↔ (𝑥 ∈ 𝐵 → 𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
79	75, 76, 78	3imtr3i 279	. . . . . 6 ⊢ (𝑥 = 𝑥 → (𝑥 ∈ 𝐵 → 𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}}))
80	40, 79	ax-mp 5	. . . . 5 ⊢ (𝑥 ∈ 𝐵 → 𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}})
81	39, 80	impbii 198	. . . 4 ⊢ (𝑥 ∈ ∪ {𝑢 ∣ ∃𝑥 ∈ 𝐵 𝑢 = {𝑥}} ↔ 𝑥 ∈ 𝐵)
82	11, 81	syl6bb 275	. . 3 ⊢ (𝐵 ⊆ 𝐴 → (𝑥 ∈ ∪ (𝐹 “ 𝐵) ↔ 𝑥 ∈ 𝐵))
83	82	eqrdv 2608	. 2 ⊢ (𝐵 ⊆ 𝐴 → ∪ (𝐹 “ 𝐵) = 𝐵)
84	83	eqcomd 2616	1 ⊢ (𝐵 ⊆ 𝐴 → 𝐵 = ∪ (𝐹 “ 𝐵))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475  ∃wex 1695  Ⅎwnf 1699  [wsb 1867   ∈ wcel 1977  {cab 2596  ∃wrex 2897  Vcvv 3173  [wsbc 3402   ⊆ wss 3540  {csn 4125  ∪ cuni 4372   ↦ cmpt 4643  ran crn 5039   ↾ cres 5040   “ cima 5041

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-xp 5044  df-rel 5045  df-cnv 5046  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051

This theorem is referenced by:  mptsnun  32362