Theorem isnrm3 22863

Description: A topological space is normal iff any two disjoint closed sets are separated by open sets. (Contributed by Mario Carneiro, 24-Aug-2015.)

Assertion

Ref	Expression
isnrm3	⊢ (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))))

Distinct variable groups:   𝑥,𝑦   𝑐,𝑑,𝑥,𝑦,𝐽

Proof of Theorem isnrm3

Step	Hyp	Ref	Expression
1		nrmtop 22840	. . 3 ⊢ (𝐽 ∈ Nrm → 𝐽 ∈ Top)
2		nrmsep 22861	. . . . . 6 ⊢ ((𝐽 ∈ Nrm ∧ (𝑐 ∈ (Clsd‘𝐽) ∧ 𝑑 ∈ (Clsd‘𝐽) ∧ (𝑐 ∩ 𝑑) = ∅)) → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))
3	2	3exp2 1355	. . . . 5 ⊢ (𝐽 ∈ Nrm → (𝑐 ∈ (Clsd‘𝐽) → (𝑑 ∈ (Clsd‘𝐽) → ((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)))))
4	3	impd 412	. . . 4 ⊢ (𝐽 ∈ Nrm → ((𝑐 ∈ (Clsd‘𝐽) ∧ 𝑑 ∈ (Clsd‘𝐽)) → ((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))))
5	4	ralrimivv 3199	. . 3 ⊢ (𝐽 ∈ Nrm → ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)))
6	1, 5	jca 513	. 2 ⊢ (𝐽 ∈ Nrm → (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))))
7		simpl 484	. . 3 ⊢ ((𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))) → 𝐽 ∈ Top)
8		simpr1 1195	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝑐 ⊆ 𝑥)
9		simpr2 1196	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝑑 ⊆ 𝑦)
10		sslin 4235	. . . . . . . . . . . 12 ⊢ (𝑑 ⊆ 𝑦 → (((cls‘𝐽)‘𝑥) ∩ 𝑑) ⊆ (((cls‘𝐽)‘𝑥) ∩ 𝑦))
11	9, 10	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → (((cls‘𝐽)‘𝑥) ∩ 𝑑) ⊆ (((cls‘𝐽)‘𝑥) ∩ 𝑦))
12		eqid 2733	. . . . . . . . . . . . . 14 ⊢ ∪ 𝐽 = ∪ 𝐽
13	12	opncld 22537	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ∈ 𝐽) → (∪ 𝐽 ∖ 𝑦) ∈ (Clsd‘𝐽))
14	13	ad4ant13 750	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → (∪ 𝐽 ∖ 𝑦) ∈ (Clsd‘𝐽))
15		simpr3 1197	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → (𝑥 ∩ 𝑦) = ∅)
16		simpllr 775	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝑥 ∈ 𝐽)
17		elssuni 4942	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝐽 → 𝑥 ⊆ ∪ 𝐽)
18		reldisj 4452	. . . . . . . . . . . . . 14 ⊢ (𝑥 ⊆ ∪ 𝐽 → ((𝑥 ∩ 𝑦) = ∅ ↔ 𝑥 ⊆ (∪ 𝐽 ∖ 𝑦)))
19	16, 17, 18	3syl 18	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → ((𝑥 ∩ 𝑦) = ∅ ↔ 𝑥 ⊆ (∪ 𝐽 ∖ 𝑦)))
20	15, 19	mpbid 231	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝑥 ⊆ (∪ 𝐽 ∖ 𝑦))
21	12	clsss2 22576	. . . . . . . . . . . . 13 ⊢ (((∪ 𝐽 ∖ 𝑦) ∈ (Clsd‘𝐽) ∧ 𝑥 ⊆ (∪ 𝐽 ∖ 𝑦)) → ((cls‘𝐽)‘𝑥) ⊆ (∪ 𝐽 ∖ 𝑦))
22		ssdifin0 4486	. . . . . . . . . . . . 13 ⊢ (((cls‘𝐽)‘𝑥) ⊆ (∪ 𝐽 ∖ 𝑦) → (((cls‘𝐽)‘𝑥) ∩ 𝑦) = ∅)
23	21, 22	syl 17	. . . . . . . . . . . 12 ⊢ (((∪ 𝐽 ∖ 𝑦) ∈ (Clsd‘𝐽) ∧ 𝑥 ⊆ (∪ 𝐽 ∖ 𝑦)) → (((cls‘𝐽)‘𝑥) ∩ 𝑦) = ∅)
24	14, 20, 23	syl2anc 585	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → (((cls‘𝐽)‘𝑥) ∩ 𝑦) = ∅)
25		sseq0 4400	. . . . . . . . . . 11 ⊢ (((((cls‘𝐽)‘𝑥) ∩ 𝑑) ⊆ (((cls‘𝐽)‘𝑥) ∩ 𝑦) ∧ (((cls‘𝐽)‘𝑥) ∩ 𝑦) = ∅) → (((cls‘𝐽)‘𝑥) ∩ 𝑑) = ∅)
26	11, 24, 25	syl2anc 585	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → (((cls‘𝐽)‘𝑥) ∩ 𝑑) = ∅)
27	8, 26	jca 513	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝐽) ∧ (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → (𝑐 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝑑) = ∅))
28	27	rexlimdva2 3158	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽) → (∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅) → (𝑐 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝑑) = ∅)))
29	28	reximdva 3169	. . . . . . 7 ⊢ (𝐽 ∈ Top → (∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅) → ∃𝑥 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝑑) = ∅)))
30	29	imim2d 57	. . . . . 6 ⊢ (𝐽 ∈ Top → (((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → ((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝑑) = ∅))))
31	30	ralimdv 3170	. . . . 5 ⊢ (𝐽 ∈ Top → (∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → ∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝑑) = ∅))))
32	31	ralimdv 3170	. . . 4 ⊢ (𝐽 ∈ Top → (∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅)) → ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝑑) = ∅))))
33	32	imp 408	. . 3 ⊢ ((𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))) → ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝑑) = ∅)))
34		isnrm2 22862	. . 3 ⊢ (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝑑) = ∅))))
35	7, 33, 34	sylanbrc 584	. 2 ⊢ ((𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))) → 𝐽 ∈ Nrm)
36	6, 35	impbii 208	1 ⊢ (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ (Clsd‘𝐽)∀𝑑 ∈ (Clsd‘𝐽)((𝑐 ∩ 𝑑) = ∅ → ∃𝑥 ∈ 𝐽 ∃𝑦 ∈ 𝐽 (𝑐 ⊆ 𝑥 ∧ 𝑑 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) = ∅))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107  ∀wral 3062  ∃wrex 3071   ∖ cdif 3946   ∩ cin 3948   ⊆ wss 3949  ∅c0 4323  ∪ cuni 4909  ‘cfv 6544  Topctop 22395  Clsdccld 22520  clsccl 22522  Nrmcnrm 22814

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-int 4952  df-iun 5000  df-iin 5001  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-top 22396  df-cld 22523  df-cls 22525  df-nrm 22821

This theorem is referenced by:  metnrm  24378  isnrm4  47611  dfnrm2  47612  iscnrm3  47633