Theorem fclsopn 24150

Description: Write the cluster point condition in terms of open sets. (Contributed by Jeff Hankins, 10-Nov-2009.) (Revised by Mario Carneiro, 26-Aug-2015.)

Assertion

Ref	Expression
fclsopn	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))))

Distinct variable groups:   𝑜,𝑠,𝐴   𝑜,𝐹,𝑠   𝑜,𝐽,𝑠   𝑜,𝑋,𝑠

Proof of Theorem fclsopn

Step	Hyp	Ref	Expression
1		isfcls2 24149	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
2		filn0 23998	. . . . . 6 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅)
3	2	adantl 486	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ≠ ∅)
4		r19.2z 4459	. . . . . 6 ⊢ ((𝐹 ≠ ∅ ∧ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)) → ∃𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠))
5	4	ex 417	. . . . 5 ⊢ (𝐹 ≠ ∅ → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → ∃𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
6	3, 5	syl 18	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → ∃𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
7		topontop 23049	. . . . . . . . 9 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
8	7	ad2antrr 738	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → 𝐽 ∈ Top)
9		filelss 23988	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋)
10	9	adantll 726	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋)
11		toponuni 23050	. . . . . . . . . 10 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
12	11	ad2antrr 738	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → 𝑋 = ∪ 𝐽)
13	10, 12	sseqtrd 3972	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ ∪ 𝐽)
14		eqid 2761	. . . . . . . . 9 ⊢ ∪ 𝐽 = ∪ 𝐽
15	14	clsss3 23195	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑠 ⊆ ∪ 𝐽) → ((cls‘𝐽)‘𝑠) ⊆ ∪ 𝐽)
16	8, 13, 15	syl2anc 595	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → ((cls‘𝐽)‘𝑠) ⊆ ∪ 𝐽)
17	16, 12	sseqtrrd 3973	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → ((cls‘𝐽)‘𝑠) ⊆ 𝑋)
18	17	sseld 3935	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → (𝐴 ∈ ((cls‘𝐽)‘𝑠) → 𝐴 ∈ 𝑋))
19	18	rexlimdva 3164	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∃𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → 𝐴 ∈ 𝑋))
20	6, 19	syld 48	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → 𝐴 ∈ 𝑋))
21	20	pm4.71rd 571	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠))))
22	7	ad3antrrr 742	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → 𝐽 ∈ Top)
23	13	adantlr 727	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ ∪ 𝐽)
24		simplr 780	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → 𝐴 ∈ 𝑋)
25	11	ad3antrrr 742	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑋 = ∪ 𝐽)
26	24, 25	eleqtrd 2863	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → 𝐴 ∈ ∪ 𝐽)
27	14	elcls 23209	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑠 ⊆ ∪ 𝐽 ∧ 𝐴 ∈ ∪ 𝐽) → (𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅)))
28	22, 23, 26, 27	syl3anc 1396	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → (𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅)))
29	28	ralbidva 3184	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑠 ∈ 𝐹 ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅)))
30		ralcom 3291	. . . . 5 ⊢ (∀𝑠 ∈ 𝐹 ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅) ↔ ∀𝑜 ∈ 𝐽 ∀𝑠 ∈ 𝐹 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅))
31		r19.21v 3188	. . . . . 6 ⊢ (∀𝑠 ∈ 𝐹 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅) ↔ (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))
32	31	ralbii 3109	. . . . 5 ⊢ (∀𝑜 ∈ 𝐽 ∀𝑠 ∈ 𝐹 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))
33	30, 32	bitri 278	. . . 4 ⊢ (∀𝑠 ∈ 𝐹 ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))
34	29, 33	bitrdi 290	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅)))
35	34	pm5.32da 589	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴 ∈ 𝑋 ∧ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))))
36	1, 21, 35	3bitrd 308	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1568   ∈ wcel 2141   ≠ wne 2956  ∀wral 3077  ∃wrex 3087   ∩ cin 3903   ⊆ wss 3904  ∅c0 4285  ∪ cuni 4871  ‘cfv 6536  (class class class)co 7410  Topctop 23029  TopOnctopon 23046  clsccl 23154  Filcfil 23981   fClus cfcls 24072

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-fbas 21498  df-top 23030  df-topon 23047  df-cld 23155  df-ntr 23156  df-cls 23157  df-fil 23982  df-fcls 24077

This theorem is referenced by:  fclsopni  24151  fclselbas  24152  fclsnei  24155  fclsbas  24157  fclsss1  24158  fclsrest  24160  fclscf  24161  isfcf  24170