Theorem fclsopn 22778

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 22777	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
2		filn0 22626	. . . . . 6 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅)
3	2	adantl 485	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ≠ ∅)
4		r19.2z 4391	. . . . . 6 ⊢ ((𝐹 ≠ ∅ ∧ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)) → ∃𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠))
5	4	ex 416	. . . . 5 ⊢ (𝐹 ≠ ∅ → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → ∃𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
6	3, 5	syl 17	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → ∃𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
7		topontop 21677	. . . . . . . . 9 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
8	7	ad2antrr 726	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → 𝐽 ∈ Top)
9		filelss 22616	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋)
10	9	adantll 714	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋)
11		toponuni 21678	. . . . . . . . . 10 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
12	11	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → 𝑋 = ∪ 𝐽)
13	10, 12	sseqtrd 3927	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ ∪ 𝐽)
14		eqid 2739	. . . . . . . . 9 ⊢ ∪ 𝐽 = ∪ 𝐽
15	14	clsss3 21823	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑠 ⊆ ∪ 𝐽) → ((cls‘𝐽)‘𝑠) ⊆ ∪ 𝐽)
16	8, 13, 15	syl2anc 587	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → ((cls‘𝐽)‘𝑠) ⊆ ∪ 𝐽)
17	16, 12	sseqtrrd 3928	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → ((cls‘𝐽)‘𝑠) ⊆ 𝑋)
18	17	sseld 3886	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠 ∈ 𝐹) → (𝐴 ∈ ((cls‘𝐽)‘𝑠) → 𝐴 ∈ 𝑋))
19	18	rexlimdva 3195	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∃𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → 𝐴 ∈ 𝑋))
20	6, 19	syld 47	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → 𝐴 ∈ 𝑋))
21	20	pm4.71rd 566	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠))))
22	7	ad3antrrr 730	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → 𝐽 ∈ Top)
23	13	adantlr 715	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ ∪ 𝐽)
24		simplr 769	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → 𝐴 ∈ 𝑋)
25	11	ad3antrrr 730	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑋 = ∪ 𝐽)
26	24, 25	eleqtrd 2836	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → 𝐴 ∈ ∪ 𝐽)
27	14	elcls 21837	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑠 ⊆ ∪ 𝐽 ∧ 𝐴 ∈ ∪ 𝐽) → (𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅)))
28	22, 23, 26, 27	syl3anc 1372	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑠 ∈ 𝐹) → (𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅)))
29	28	ralbidva 3109	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑠 ∈ 𝐹 ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅)))
30		ralcom 3259	. . . . 5 ⊢ (∀𝑠 ∈ 𝐹 ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅) ↔ ∀𝑜 ∈ 𝐽 ∀𝑠 ∈ 𝐹 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅))
31		r19.21v 3090	. . . . . 6 ⊢ (∀𝑠 ∈ 𝐹 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅) ↔ (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))
32	31	ralbii 3081	. . . . 5 ⊢ (∀𝑜 ∈ 𝐽 ∀𝑠 ∈ 𝐹 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))
33	30, 32	bitri 278	. . . 4 ⊢ (∀𝑠 ∈ 𝐹 ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → (𝑜 ∩ 𝑠) ≠ ∅) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))
34	29, 33	bitrdi 290	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅)))
35	34	pm5.32da 582	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴 ∈ 𝑋 ∧ ∀𝑠 ∈ 𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))))
36	1, 21, 35	3bitrd 308	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐹 (𝑜 ∩ 𝑠) ≠ ∅))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1542   ∈ wcel 2114   ≠ wne 2935  ∀wral 3054  ∃wrex 3055   ∩ cin 3852   ⊆ wss 3853  ∅c0 4221  ∪ cuni 4806  ‘cfv 6350  (class class class)co 7183  Topctop 21657  TopOnctopon 21674  clsccl 21782  Filcfil 22609   fClus cfcls 22700

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2711  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5242  ax-pr 5306  ax-un 7492

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2541  df-eu 2571  df-clab 2718  df-cleq 2731  df-clel 2812  df-nfc 2882  df-ne 2936  df-nel 3040  df-ral 3059  df-rex 3060  df-reu 3061  df-rab 3063  df-v 3402  df-sbc 3686  df-csb 3801  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4222  df-if 4425  df-pw 4500  df-sn 4527  df-pr 4529  df-op 4533  df-uni 4807  df-int 4847  df-iun 4893  df-iin 4894  df-br 5041  df-opab 5103  df-mpt 5121  df-id 5439  df-xp 5541  df-rel 5542  df-cnv 5543  df-co 5544  df-dm 5545  df-rn 5546  df-res 5547  df-ima 5548  df-iota 6308  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-ov 7186  df-oprab 7187  df-mpo 7188  df-fbas 20227  df-top 21658  df-topon 21675  df-cld 21783  df-ntr 21784  df-cls 21785  df-fil 22610  df-fcls 22705

This theorem is referenced by:  fclsopni  22779  fclselbas  22780  fclsnei  22783  fclsbas  22785  fclsss1  22786  fclsrest  22788  fclscf  22789  isfcf  22798