Theorem qtopeu 23654

Description: Universal property of the quotient topology. If 𝐺 is a function from 𝐽 to 𝐾 which is equal on all equivalent elements under 𝐹, then there is a unique continuous map 𝑓:(𝐽 / 𝐹)⟶𝐾 such that 𝐺 = 𝑓 ∘ 𝐹, and we say that 𝐺 "passes to the quotient". (Contributed by Mario Carneiro, 24-Mar-2015.)

Hypotheses

Ref	Expression
qtopeu.1	⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
qtopeu.3	⊢ (𝜑 → 𝐹:𝑋–onto→𝑌)
qtopeu.4	⊢ (𝜑 → 𝐺 ∈ (𝐽 Cn 𝐾))
qtopeu.5	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐺‘𝑥) = (𝐺‘𝑦))

Assertion

Ref	Expression
qtopeu	⊢ (𝜑 → ∃!𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)𝐺 = (𝑓 ∘ 𝐹))

Distinct variable groups:   𝑥,𝑓,𝑦,𝐹   𝑓,𝐽,𝑥   𝑓,𝐾,𝑥   𝑥,𝑋,𝑦   𝑓,𝐺,𝑥,𝑦   𝜑,𝑓,𝑥,𝑦   𝑓,𝑌,𝑥

Allowed substitution hints:   𝐽(𝑦)   𝐾(𝑦)   𝑋(𝑓)   𝑌(𝑦)

Proof of Theorem qtopeu

Dummy variables 𝑔 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		qtopeu.3	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐹:𝑋–onto→𝑌)
2		fofn 6792	. . . . . . . . . . . . . . . 16 ⊢ (𝐹:𝑋–onto→𝑌 → 𝐹 Fn 𝑋)
3	1, 2	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹 Fn 𝑋)
4	3	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐹 Fn 𝑋)
5		fniniseg 7050	. . . . . . . . . . . . . 14 ⊢ (𝐹 Fn 𝑋 → (𝑦 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = (𝐹‘𝑥))))
6	4, 5	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑦 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = (𝐹‘𝑥))))
7		eqcom 2742	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (𝐹‘𝑦) = (𝐹‘𝑥))
8	7	3anbi3i 1159	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) ↔ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = (𝐹‘𝑥)))
9		3anass 1094	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = (𝐹‘𝑥)) ↔ (𝑥 ∈ 𝑋 ∧ (𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = (𝐹‘𝑥))))
10	8, 9	bitri 275	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) ↔ (𝑥 ∈ 𝑋 ∧ (𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = (𝐹‘𝑥))))
11		qtopeu.5	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐺‘𝑥) = (𝐺‘𝑦))
12	10, 11	sylan2br 595	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ (𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = (𝐹‘𝑥)))) → (𝐺‘𝑥) = (𝐺‘𝑦))
13	12	eqcomd 2741	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ (𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = (𝐹‘𝑥)))) → (𝐺‘𝑦) = (𝐺‘𝑥))
14	13	expr 456	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = (𝐹‘𝑥)) → (𝐺‘𝑦) = (𝐺‘𝑥)))
15	6, 14	sylbid 240	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑦 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) → (𝐺‘𝑦) = (𝐺‘𝑥)))
16	15	ralrimiv 3131	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑦 ∈ (◡𝐹 “ {(𝐹‘𝑥)})(𝐺‘𝑦) = (𝐺‘𝑥))
17		qtopeu.1	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
18		qtopeu.4	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐺 ∈ (𝐽 Cn 𝐾))
19		cntop2 23179	. . . . . . . . . . . . . . . . 17 ⊢ (𝐺 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
20	18, 19	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐾 ∈ Top)
21		toptopon2 22856	. . . . . . . . . . . . . . . 16 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
22	20, 21	sylib 218	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
23		cnf2 23187	. . . . . . . . . . . . . . 15 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝐺 ∈ (𝐽 Cn 𝐾)) → 𝐺:𝑋⟶∪ 𝐾)
24	17, 22, 18, 23	syl3anc 1373	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺:𝑋⟶∪ 𝐾)
25	24	ffnd 6707	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺 Fn 𝑋)
26	25	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐺 Fn 𝑋)
27		cnvimass 6069	. . . . . . . . . . . . 13 ⊢ (◡𝐹 “ {(𝐹‘𝑥)}) ⊆ dom 𝐹
28		fof 6790	. . . . . . . . . . . . . . . 16 ⊢ (𝐹:𝑋–onto→𝑌 → 𝐹:𝑋⟶𝑌)
29	1, 28	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹:𝑋⟶𝑌)
30	29	fdmd 6716	. . . . . . . . . . . . . 14 ⊢ (𝜑 → dom 𝐹 = 𝑋)
31	30	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → dom 𝐹 = 𝑋)
32	27, 31	sseqtrid 4001	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (◡𝐹 “ {(𝐹‘𝑥)}) ⊆ 𝑋)
33		eqeq1 2739	. . . . . . . . . . . . 13 ⊢ (𝑤 = (𝐺‘𝑦) → (𝑤 = (𝐺‘𝑥) ↔ (𝐺‘𝑦) = (𝐺‘𝑥)))
34	33	ralima 7229	. . . . . . . . . . . 12 ⊢ ((𝐺 Fn 𝑋 ∧ (◡𝐹 “ {(𝐹‘𝑥)}) ⊆ 𝑋) → (∀𝑤 ∈ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)}))𝑤 = (𝐺‘𝑥) ↔ ∀𝑦 ∈ (◡𝐹 “ {(𝐹‘𝑥)})(𝐺‘𝑦) = (𝐺‘𝑥)))
35	26, 32, 34	syl2anc 584	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (∀𝑤 ∈ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)}))𝑤 = (𝐺‘𝑥) ↔ ∀𝑦 ∈ (◡𝐹 “ {(𝐹‘𝑥)})(𝐺‘𝑦) = (𝐺‘𝑥)))
36	16, 35	mpbird 257	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑤 ∈ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)}))𝑤 = (𝐺‘𝑥))
37	24	fdmd 6716	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → dom 𝐺 = 𝑋)
38	37	eleq2d 2820	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑥 ∈ dom 𝐺 ↔ 𝑥 ∈ 𝑋))
39	38	biimpar 477	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ dom 𝐺)
40		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
41		eqidd 2736	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) = (𝐹‘𝑥))
42		fniniseg 7050	. . . . . . . . . . . . . . 15 ⊢ (𝐹 Fn 𝑋 → (𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) = (𝐹‘𝑥))))
43	4, 42	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) = (𝐹‘𝑥))))
44	40, 41, 43	mpbir2and 713	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)}))
45		inelcm 4440	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ dom 𝐺 ∧ 𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)})) → (dom 𝐺 ∩ (◡𝐹 “ {(𝐹‘𝑥)})) ≠ ∅)
46	39, 44, 45	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (dom 𝐺 ∩ (◡𝐹 “ {(𝐹‘𝑥)})) ≠ ∅)
47		imadisj 6067	. . . . . . . . . . . . 13 ⊢ ((𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) = ∅ ↔ (dom 𝐺 ∩ (◡𝐹 “ {(𝐹‘𝑥)})) = ∅)
48	47	necon3bii 2984	. . . . . . . . . . . 12 ⊢ ((𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) ≠ ∅ ↔ (dom 𝐺 ∩ (◡𝐹 “ {(𝐹‘𝑥)})) ≠ ∅)
49	46, 48	sylibr 234	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) ≠ ∅)
50		eqsn 4805	. . . . . . . . . . 11 ⊢ ((𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) ≠ ∅ → ((𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) = {(𝐺‘𝑥)} ↔ ∀𝑤 ∈ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)}))𝑤 = (𝐺‘𝑥)))
51	49, 50	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) = {(𝐺‘𝑥)} ↔ ∀𝑤 ∈ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)}))𝑤 = (𝐺‘𝑥)))
52	36, 51	mpbird 257	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) = {(𝐺‘𝑥)})
53	52	unieqd 4896	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) = ∪ {(𝐺‘𝑥)})
54		fvex 6889	. . . . . . . . 9 ⊢ (𝐺‘𝑥) ∈ V
55	54	unisn 4902	. . . . . . . 8 ⊢ ∪ {(𝐺‘𝑥)} = (𝐺‘𝑥)
56	53, 55	eqtr2di 2787	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺‘𝑥) = ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})))
57	56	mpteq2dva 5214	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)) = (𝑥 ∈ 𝑋 ↦ ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)}))))
58	24	feqmptd 6947	. . . . . 6 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
59	29	ffvelcdmda 7074	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ 𝑌)
60	29	feqmptd 6947	. . . . . . 7 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
61		eqidd 2736	. . . . . . 7 ⊢ (𝜑 → (𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) = (𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))))
62		sneq 4611	. . . . . . . . . 10 ⊢ (𝑤 = (𝐹‘𝑥) → {𝑤} = {(𝐹‘𝑥)})
63	62	imaeq2d 6047	. . . . . . . . 9 ⊢ (𝑤 = (𝐹‘𝑥) → (◡𝐹 “ {𝑤}) = (◡𝐹 “ {(𝐹‘𝑥)}))
64	63	imaeq2d 6047	. . . . . . . 8 ⊢ (𝑤 = (𝐹‘𝑥) → (𝐺 “ (◡𝐹 “ {𝑤})) = (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})))
65	64	unieqd 4896	. . . . . . 7 ⊢ (𝑤 = (𝐹‘𝑥) → ∪ (𝐺 “ (◡𝐹 “ {𝑤})) = ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})))
66	59, 60, 61, 65	fmptco 7119	. . . . . 6 ⊢ (𝜑 → ((𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∘ 𝐹) = (𝑥 ∈ 𝑋 ↦ ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)}))))
67	57, 58, 66	3eqtr4d 2780	. . . . 5 ⊢ (𝜑 → 𝐺 = ((𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∘ 𝐹))
68	67, 18	eqeltrrd 2835	. . . 4 ⊢ (𝜑 → ((𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∘ 𝐹) ∈ (𝐽 Cn 𝐾))
69	24	ffvelcdmda 7074	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺‘𝑥) ∈ ∪ 𝐾)
70	56, 69	eqeltrrd 2835	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) ∈ ∪ 𝐾)
71	70	ralrimiva 3132	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) ∈ ∪ 𝐾)
72	65	eqcomd 2741	. . . . . . . . . . 11 ⊢ (𝑤 = (𝐹‘𝑥) → ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) = ∪ (𝐺 “ (◡𝐹 “ {𝑤})))
73	72	eqcoms 2743	. . . . . . . . . 10 ⊢ ((𝐹‘𝑥) = 𝑤 → ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) = ∪ (𝐺 “ (◡𝐹 “ {𝑤})))
74	73	eleq1d 2819	. . . . . . . . 9 ⊢ ((𝐹‘𝑥) = 𝑤 → (∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) ∈ ∪ 𝐾 ↔ ∪ (𝐺 “ (◡𝐹 “ {𝑤})) ∈ ∪ 𝐾))
75	74	cbvfo 7282	. . . . . . . 8 ⊢ (𝐹:𝑋–onto→𝑌 → (∀𝑥 ∈ 𝑋 ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) ∈ ∪ 𝐾 ↔ ∀𝑤 ∈ 𝑌 ∪ (𝐺 “ (◡𝐹 “ {𝑤})) ∈ ∪ 𝐾))
76	1, 75	syl 17	. . . . . . 7 ⊢ (𝜑 → (∀𝑥 ∈ 𝑋 ∪ (𝐺 “ (◡𝐹 “ {(𝐹‘𝑥)})) ∈ ∪ 𝐾 ↔ ∀𝑤 ∈ 𝑌 ∪ (𝐺 “ (◡𝐹 “ {𝑤})) ∈ ∪ 𝐾))
77	71, 76	mpbid 232	. . . . . 6 ⊢ (𝜑 → ∀𝑤 ∈ 𝑌 ∪ (𝐺 “ (◡𝐹 “ {𝑤})) ∈ ∪ 𝐾)
78		eqid 2735	. . . . . . 7 ⊢ (𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) = (𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤})))
79	78	fmpt 7100	. . . . . 6 ⊢ (∀𝑤 ∈ 𝑌 ∪ (𝐺 “ (◡𝐹 “ {𝑤})) ∈ ∪ 𝐾 ↔ (𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))):𝑌⟶∪ 𝐾)
80	77, 79	sylib 218	. . . . 5 ⊢ (𝜑 → (𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))):𝑌⟶∪ 𝐾)
81		qtopcn 23652	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾)) ∧ (𝐹:𝑋–onto→𝑌 ∧ (𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))):𝑌⟶∪ 𝐾)) → ((𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ↔ ((𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∘ 𝐹) ∈ (𝐽 Cn 𝐾)))
82	17, 22, 1, 80, 81	syl22anc 838	. . . 4 ⊢ (𝜑 → ((𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ↔ ((𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∘ 𝐹) ∈ (𝐽 Cn 𝐾)))
83	68, 82	mpbird 257	. . 3 ⊢ (𝜑 → (𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∈ ((𝐽 qTop 𝐹) Cn 𝐾))
84		coeq1 5837	. . . 4 ⊢ (𝑓 = (𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) → (𝑓 ∘ 𝐹) = ((𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∘ 𝐹))
85	84	rspceeqv 3624	. . 3 ⊢ (((𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝐺 = ((𝑤 ∈ 𝑌 ↦ ∪ (𝐺 “ (◡𝐹 “ {𝑤}))) ∘ 𝐹)) → ∃𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)𝐺 = (𝑓 ∘ 𝐹))
86	83, 67, 85	syl2anc 584	. 2 ⊢ (𝜑 → ∃𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)𝐺 = (𝑓 ∘ 𝐹))
87		eqtr2 2756	. . . 4 ⊢ ((𝐺 = (𝑓 ∘ 𝐹) ∧ 𝐺 = (𝑔 ∘ 𝐹)) → (𝑓 ∘ 𝐹) = (𝑔 ∘ 𝐹))
88	1	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → 𝐹:𝑋–onto→𝑌)
89		qtoptopon 23642	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → (𝐽 qTop 𝐹) ∈ (TopOn‘𝑌))
90	17, 1, 89	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → (𝐽 qTop 𝐹) ∈ (TopOn‘𝑌))
91	90	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → (𝐽 qTop 𝐹) ∈ (TopOn‘𝑌))
92	22	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → 𝐾 ∈ (TopOn‘∪ 𝐾))
93		simprl 770	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → 𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))
94		cnf2 23187	. . . . . . 7 ⊢ (((𝐽 qTop 𝐹) ∈ (TopOn‘𝑌) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)) → 𝑓:𝑌⟶∪ 𝐾)
95	91, 92, 93, 94	syl3anc 1373	. . . . . 6 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → 𝑓:𝑌⟶∪ 𝐾)
96	95	ffnd 6707	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → 𝑓 Fn 𝑌)
97		simprr 772	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))
98		cnf2 23187	. . . . . . 7 ⊢ (((𝐽 qTop 𝐹) ∈ (TopOn‘𝑌) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)) → 𝑔:𝑌⟶∪ 𝐾)
99	91, 92, 97, 98	syl3anc 1373	. . . . . 6 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → 𝑔:𝑌⟶∪ 𝐾)
100	99	ffnd 6707	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → 𝑔 Fn 𝑌)
101		cocan2 7285	. . . . 5 ⊢ ((𝐹:𝑋–onto→𝑌 ∧ 𝑓 Fn 𝑌 ∧ 𝑔 Fn 𝑌) → ((𝑓 ∘ 𝐹) = (𝑔 ∘ 𝐹) ↔ 𝑓 = 𝑔))
102	88, 96, 100, 101	syl3anc 1373	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → ((𝑓 ∘ 𝐹) = (𝑔 ∘ 𝐹) ↔ 𝑓 = 𝑔))
103	87, 102	imbitrid 244	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ∧ 𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾))) → ((𝐺 = (𝑓 ∘ 𝐹) ∧ 𝐺 = (𝑔 ∘ 𝐹)) → 𝑓 = 𝑔))
104	103	ralrimivva 3187	. 2 ⊢ (𝜑 → ∀𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)∀𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)((𝐺 = (𝑓 ∘ 𝐹) ∧ 𝐺 = (𝑔 ∘ 𝐹)) → 𝑓 = 𝑔))
105		coeq1 5837	. . . 4 ⊢ (𝑓 = 𝑔 → (𝑓 ∘ 𝐹) = (𝑔 ∘ 𝐹))
106	105	eqeq2d 2746	. . 3 ⊢ (𝑓 = 𝑔 → (𝐺 = (𝑓 ∘ 𝐹) ↔ 𝐺 = (𝑔 ∘ 𝐹)))
107	106	reu4 3714	. 2 ⊢ (∃!𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)𝐺 = (𝑓 ∘ 𝐹) ↔ (∃𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)𝐺 = (𝑓 ∘ 𝐹) ∧ ∀𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)∀𝑔 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)((𝐺 = (𝑓 ∘ 𝐹) ∧ 𝐺 = (𝑔 ∘ 𝐹)) → 𝑓 = 𝑔)))
108	86, 104, 107	sylanbrc 583	1 ⊢ (𝜑 → ∃!𝑓 ∈ ((𝐽 qTop 𝐹) Cn 𝐾)𝐺 = (𝑓 ∘ 𝐹))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2108   ≠ wne 2932  ∀wral 3051  ∃wrex 3060  ∃!wreu 3357   ∩ cin 3925   ⊆ wss 3926  ∅c0 4308  {csn 4601  ∪ cuni 4883   ↦ cmpt 5201  ^◡ccnv 5653  dom cdm 5654   “ cima 5657   ∘ ccom 5658   Fn wfn 6526  ⟶wf 6527  –onto→wfo 6529  ‘cfv 6531  (class class class)co 7405   qTop cqtop 17517  Topctop 22831  TopOnctopon 22848   Cn ccn 23162

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-map 8842  df-qtop 17521  df-top 22832  df-topon 22849  df-cn 23165

This theorem is referenced by:  qtophmeo  23755