Theorem regr1lem2 23966

Description: A Kolmogorov quotient of a regular space is Hausdorff. (Contributed by Mario Carneiro, 25-Aug-2015.)

Hypothesis

Ref	Expression
kqval.2	⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})

Assertion

Ref	Expression
regr1lem2	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) → (KQ‘𝐽) ∈ Haus)

Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝑋,𝑦

Allowed substitution hints:   𝐹(𝑥, 𝑦)

Proof of Theorem regr1lem2

Dummy variables 𝑚 𝑛 𝑤 𝑧 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		kqval.2	. . . . . . . . . 10 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})
2		simplll 787	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ (𝑎 ∈ 𝐽 ∧ ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))) → 𝐽 ∈ (TopOn‘𝑋))
3		simpllr 788	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ (𝑎 ∈ 𝐽 ∧ ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))) → 𝐽 ∈ Reg)
4		simplrl 789	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ (𝑎 ∈ 𝐽 ∧ ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))) → 𝑧 ∈ 𝑋)
5		simplrr 790	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ (𝑎 ∈ 𝐽 ∧ ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))) → 𝑤 ∈ 𝑋)
6		simprl 783	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ (𝑎 ∈ 𝐽 ∧ ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))) → 𝑎 ∈ 𝐽)
7		simprr 785	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ (𝑎 ∈ 𝐽 ∧ ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))) → ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))
8	1, 2, 3, 4, 5, 6, 7	regr1lem 23965	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ (𝑎 ∈ 𝐽 ∧ ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))) → (𝑧 ∈ 𝑎 → 𝑤 ∈ 𝑎))
9		3ancoma 1115	. . . . . . . . . . . . . 14 ⊢ (((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ((𝐹‘𝑤) ∈ 𝑛 ∧ (𝐹‘𝑧) ∈ 𝑚 ∧ (𝑚 ∩ 𝑛) = ∅))
10		incom 4155	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 ∩ 𝑛) = (𝑛 ∩ 𝑚)
11	10	eqeq1i 2765	. . . . . . . . . . . . . . 15 ⊢ ((𝑚 ∩ 𝑛) = ∅ ↔ (𝑛 ∩ 𝑚) = ∅)
12	11	3anbi3i 1177	. . . . . . . . . . . . . 14 ⊢ (((𝐹‘𝑤) ∈ 𝑛 ∧ (𝐹‘𝑧) ∈ 𝑚 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ((𝐹‘𝑤) ∈ 𝑛 ∧ (𝐹‘𝑧) ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))
13	9, 12	bitri 278	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ((𝐹‘𝑤) ∈ 𝑛 ∧ (𝐹‘𝑧) ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))
14	13	2rexbii 3138	. . . . . . . . . . . 12 ⊢ (∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑤) ∈ 𝑛 ∧ (𝐹‘𝑧) ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))
15		rexcom 3291	. . . . . . . . . . . 12 ⊢ (∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑤) ∈ 𝑛 ∧ (𝐹‘𝑧) ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) ↔ ∃𝑛 ∈ (KQ‘𝐽)∃𝑚 ∈ (KQ‘𝐽)((𝐹‘𝑤) ∈ 𝑛 ∧ (𝐹‘𝑧) ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))
16	14, 15	bitri 278	. . . . . . . . . . 11 ⊢ (∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ∃𝑛 ∈ (KQ‘𝐽)∃𝑚 ∈ (KQ‘𝐽)((𝐹‘𝑤) ∈ 𝑛 ∧ (𝐹‘𝑧) ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))
17	7, 16	sylnib 331	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ (𝑎 ∈ 𝐽 ∧ ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))) → ¬ ∃𝑛 ∈ (KQ‘𝐽)∃𝑚 ∈ (KQ‘𝐽)((𝐹‘𝑤) ∈ 𝑛 ∧ (𝐹‘𝑧) ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))
18	1, 2, 3, 5, 4, 6, 17	regr1lem 23965	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ (𝑎 ∈ 𝐽 ∧ ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))) → (𝑤 ∈ 𝑎 → 𝑧 ∈ 𝑎))
19	8, 18	impbid 215	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ (𝑎 ∈ 𝐽 ∧ ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))) → (𝑧 ∈ 𝑎 ↔ 𝑤 ∈ 𝑎))
20	19	expr 462	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) ∧ 𝑎 ∈ 𝐽) → (¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) → (𝑧 ∈ 𝑎 ↔ 𝑤 ∈ 𝑎)))
21	20	ralrimdva 3162	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → (¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) → ∀𝑎 ∈ 𝐽 (𝑧 ∈ 𝑎 ↔ 𝑤 ∈ 𝑎)))
22	1	kqfeq 23950	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ ∀𝑦 ∈ 𝐽 (𝑧 ∈ 𝑦 ↔ 𝑤 ∈ 𝑦)))
23		elequ2 2160	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑎 → (𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝑎))
24		elequ2 2160	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑎 → (𝑤 ∈ 𝑦 ↔ 𝑤 ∈ 𝑎))
25	23, 24	bibi12d 348	. . . . . . . . . 10 ⊢ (𝑦 = 𝑎 → ((𝑧 ∈ 𝑦 ↔ 𝑤 ∈ 𝑦) ↔ (𝑧 ∈ 𝑎 ↔ 𝑤 ∈ 𝑎)))
26	25	cbvralvw 3240	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐽 (𝑧 ∈ 𝑦 ↔ 𝑤 ∈ 𝑦) ↔ ∀𝑎 ∈ 𝐽 (𝑧 ∈ 𝑎 ↔ 𝑤 ∈ 𝑎))
27	22, 26	bitrdi 290	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ ∀𝑎 ∈ 𝐽 (𝑧 ∈ 𝑎 ↔ 𝑤 ∈ 𝑎)))
28	27	3expb 1138	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ ∀𝑎 ∈ 𝐽 (𝑧 ∈ 𝑎 ↔ 𝑤 ∈ 𝑎)))
29	28	adantlr 728	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ ∀𝑎 ∈ 𝐽 (𝑧 ∈ 𝑎 ↔ 𝑤 ∈ 𝑎)))
30	21, 29	sylibrd 262	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → (¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) → (𝐹‘𝑧) = (𝐹‘𝑤)))
31	30	necon1ad 2972	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
32	31	ralrimivva 3205	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) → ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
33	1	kqffn 23951	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
34	33	adantr 486	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) → 𝐹 Fn 𝑋)
35		neeq1 3017	. . . . . . . 8 ⊢ (𝑎 = (𝐹‘𝑧) → (𝑎 ≠ 𝑏 ↔ (𝐹‘𝑧) ≠ 𝑏))
36		eleq1 2848	. . . . . . . . . 10 ⊢ (𝑎 = (𝐹‘𝑧) → (𝑎 ∈ 𝑚 ↔ (𝐹‘𝑧) ∈ 𝑚))
37	36	3anbi1d 1468	. . . . . . . . 9 ⊢ (𝑎 = (𝐹‘𝑧) → ((𝑎 ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ((𝐹‘𝑧) ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
38	37	2rexbidv 3227	. . . . . . . 8 ⊢ (𝑎 = (𝐹‘𝑧) → (∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)(𝑎 ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
39	35, 38	imbi12d 347	. . . . . . 7 ⊢ (𝑎 = (𝐹‘𝑧) → ((𝑎 ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)(𝑎 ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ ((𝐹‘𝑧) ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
40	39	ralbidv 3185	. . . . . 6 ⊢ (𝑎 = (𝐹‘𝑧) → (∀𝑏 ∈ ran 𝐹(𝑎 ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)(𝑎 ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ ∀𝑏 ∈ ran 𝐹((𝐹‘𝑧) ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
41	40	ralrn 7081	. . . . 5 ⊢ (𝐹 Fn 𝑋 → (∀𝑎 ∈ ran 𝐹∀𝑏 ∈ ran 𝐹(𝑎 ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)(𝑎 ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ ∀𝑧 ∈ 𝑋 ∀𝑏 ∈ ran 𝐹((𝐹‘𝑧) ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
42		neeq2 3018	. . . . . . . 8 ⊢ (𝑏 = (𝐹‘𝑤) → ((𝐹‘𝑧) ≠ 𝑏 ↔ (𝐹‘𝑧) ≠ (𝐹‘𝑤)))
43		eleq1 2848	. . . . . . . . . 10 ⊢ (𝑏 = (𝐹‘𝑤) → (𝑏 ∈ 𝑛 ↔ (𝐹‘𝑤) ∈ 𝑛))
44	43	3anbi2d 1469	. . . . . . . . 9 ⊢ (𝑏 = (𝐹‘𝑤) → (((𝐹‘𝑧) ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
45	44	2rexbidv 3227	. . . . . . . 8 ⊢ (𝑏 = (𝐹‘𝑤) → (∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
46	42, 45	imbi12d 347	. . . . . . 7 ⊢ (𝑏 = (𝐹‘𝑤) → (((𝐹‘𝑧) ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
47	46	ralrn 7081	. . . . . 6 ⊢ (𝐹 Fn 𝑋 → (∀𝑏 ∈ ran 𝐹((𝐹‘𝑧) ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ ∀𝑤 ∈ 𝑋 ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
48	47	ralbidv 3185	. . . . 5 ⊢ (𝐹 Fn 𝑋 → (∀𝑧 ∈ 𝑋 ∀𝑏 ∈ ran 𝐹((𝐹‘𝑧) ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
49	41, 48	bitrd 282	. . . 4 ⊢ (𝐹 Fn 𝑋 → (∀𝑎 ∈ ran 𝐹∀𝑏 ∈ ran 𝐹(𝑎 ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)(𝑎 ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
50	34, 49	syl 18	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) → (∀𝑎 ∈ ran 𝐹∀𝑏 ∈ ran 𝐹(𝑎 ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)(𝑎 ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝑧) ∈ 𝑚 ∧ (𝐹‘𝑤) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
51	32, 50	mpbird 260	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) → ∀𝑎 ∈ ran 𝐹∀𝑏 ∈ ran 𝐹(𝑎 ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)(𝑎 ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
52	1	kqtopon 23953	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (KQ‘𝐽) ∈ (TopOn‘ran 𝐹))
53	52	adantr 486	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) → (KQ‘𝐽) ∈ (TopOn‘ran 𝐹))
54		ishaus2 23576	. . 3 ⊢ ((KQ‘𝐽) ∈ (TopOn‘ran 𝐹) → ((KQ‘𝐽) ∈ Haus ↔ ∀𝑎 ∈ ran 𝐹∀𝑏 ∈ ran 𝐹(𝑎 ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)(𝑎 ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
55	53, 54	syl 18	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) → ((KQ‘𝐽) ∈ Haus ↔ ∀𝑎 ∈ ran 𝐹∀𝑏 ∈ ran 𝐹(𝑎 ≠ 𝑏 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)(𝑎 ∈ 𝑚 ∧ 𝑏 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
56	51, 55	mpbird 260	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ Reg) → (KQ‘𝐽) ∈ Haus)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  {crab 3412   ∩ cin 3898  ∅c0 4279   ↦ cmpt 5186  ran crn 5656   Fn wfn 6528  ‘cfv 6533  TopOnctopon 23135  Hauscha 23533  Regcreg 23534  KQckq 23919

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-qtop 17593  df-top 23119  df-topon 23136  df-cld 23244  df-cls 23246  df-haus 23540  df-reg 23541  df-kq 23920

This theorem is used by:  regr1  23976