Theorem fclsbas 24253

Description: Cluster points in terms of filter bases. (Contributed by Jeff Hankins, 13-Nov-2009.) (Revised by Stefan O'Rear, 8-Aug-2015.)

Hypothesis

Ref	Expression
fclsbas.f	⊢ 𝐹 = (𝑋filGen𝐵)

Assertion

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

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

Allowed substitution hints:   𝐴(𝑠)   𝐹(𝑠)   𝐽(𝑠)   𝑋(𝑠)

Proof of Theorem fclsbas

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fclsbas.f	. . . 4 ⊢ 𝐹 = (𝑋filGen𝐵)
2		fgcl 24110	. . . . 5 ⊢ (𝐵 ∈ (fBas‘𝑋) → (𝑋filGen𝐵) ∈ (Fil‘𝑋))
3	2	adantl 487	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝑋filGen𝐵) ∈ (Fil‘𝑋))
4	1, 3	eqeltrid 2866	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → 𝐹 ∈ (Fil‘𝑋))
5		fclsopn 24246	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅))))
6	4, 5	syldan 603	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅))))
7		ssfg 24104	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (fBas‘𝑋) → 𝐵 ⊆ (𝑋filGen𝐵))
8	7	ad3antlr 744	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑜 ∈ 𝐽 ∧ 𝐴 ∈ 𝑜)) → 𝐵 ⊆ (𝑋filGen𝐵))
9	8, 1	sseqtrrdi 3975	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑜 ∈ 𝐽 ∧ 𝐴 ∈ 𝑜)) → 𝐵 ⊆ 𝐹)
10		ssralv 4003	. . . . . . . . 9 ⊢ (𝐵 ⊆ 𝐹 → (∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅ → ∀𝑡 ∈ 𝐵 (𝑜 ∩ 𝑡) ≠ ∅))
11	9, 10	syl 18	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑜 ∈ 𝐽 ∧ 𝐴 ∈ 𝑜)) → (∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅ → ∀𝑡 ∈ 𝐵 (𝑜 ∩ 𝑡) ≠ ∅))
12		ineq2 4163	. . . . . . . . . 10 ⊢ (𝑡 = 𝑠 → (𝑜 ∩ 𝑡) = (𝑜 ∩ 𝑠))
13	12	neeq1d 3016	. . . . . . . . 9 ⊢ (𝑡 = 𝑠 → ((𝑜 ∩ 𝑡) ≠ ∅ ↔ (𝑜 ∩ 𝑠) ≠ ∅))
14	13	cbvralvw 3242	. . . . . . . 8 ⊢ (∀𝑡 ∈ 𝐵 (𝑜 ∩ 𝑡) ≠ ∅ ↔ ∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅)
15	11, 14	imbitrdi 254	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑜 ∈ 𝐽 ∧ 𝐴 ∈ 𝑜)) → (∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅ → ∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅))
16	1	eleq2i 2854	. . . . . . . . . . 11 ⊢ (𝑡 ∈ 𝐹 ↔ 𝑡 ∈ (𝑋filGen𝐵))
17		elfg 24103	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ (fBas‘𝑋) → (𝑡 ∈ (𝑋filGen𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡)))
18	17	ad3antlr 744	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑜 ∈ 𝐽 ∧ 𝐴 ∈ 𝑜)) → (𝑡 ∈ (𝑋filGen𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡)))
19	16, 18	bitrid 286	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑜 ∈ 𝐽 ∧ 𝐴 ∈ 𝑜)) → (𝑡 ∈ 𝐹 ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡)))
20	19	simplbda 505	. . . . . . . . 9 ⊢ (((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑜 ∈ 𝐽 ∧ 𝐴 ∈ 𝑜)) ∧ 𝑡 ∈ 𝐹) → ∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡)
21		r19.29r 3128	. . . . . . . . . . 11 ⊢ ((∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 ∧ ∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅) → ∃𝑠 ∈ 𝐵 (𝑠 ⊆ 𝑡 ∧ (𝑜 ∩ 𝑠) ≠ ∅))
22		sslin 4191	. . . . . . . . . . . . 13 ⊢ (𝑠 ⊆ 𝑡 → (𝑜 ∩ 𝑠) ⊆ (𝑜 ∩ 𝑡))
23		ssn0 4358	. . . . . . . . . . . . 13 ⊢ (((𝑜 ∩ 𝑠) ⊆ (𝑜 ∩ 𝑡) ∧ (𝑜 ∩ 𝑠) ≠ ∅) → (𝑜 ∩ 𝑡) ≠ ∅)
24	22, 23	sylan 592	. . . . . . . . . . . 12 ⊢ ((𝑠 ⊆ 𝑡 ∧ (𝑜 ∩ 𝑠) ≠ ∅) → (𝑜 ∩ 𝑡) ≠ ∅)
25	24	rexlimivw 3161	. . . . . . . . . . 11 ⊢ (∃𝑠 ∈ 𝐵 (𝑠 ⊆ 𝑡 ∧ (𝑜 ∩ 𝑠) ≠ ∅) → (𝑜 ∩ 𝑡) ≠ ∅)
26	21, 25	syl 18	. . . . . . . . . 10 ⊢ ((∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 ∧ ∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅) → (𝑜 ∩ 𝑡) ≠ ∅)
27	26	ex 418	. . . . . . . . 9 ⊢ (∃𝑠 ∈ 𝐵 𝑠 ⊆ 𝑡 → (∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅ → (𝑜 ∩ 𝑡) ≠ ∅))
28	20, 27	syl 18	. . . . . . . 8 ⊢ (((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑜 ∈ 𝐽 ∧ 𝐴 ∈ 𝑜)) ∧ 𝑡 ∈ 𝐹) → (∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅ → (𝑜 ∩ 𝑡) ≠ ∅))
29	28	ralrimdva 3164	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑜 ∈ 𝐽 ∧ 𝐴 ∈ 𝑜)) → (∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅ → ∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅))
30	15, 29	impbid 215	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ (𝑜 ∈ 𝐽 ∧ 𝐴 ∈ 𝑜)) → (∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅ ↔ ∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅))
31	30	anassrs 473	. . . . 5 ⊢ (((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑜 ∈ 𝐽) ∧ 𝐴 ∈ 𝑜) → (∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅ ↔ ∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅))
32	31	pm5.74da 816	. . . 4 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) ∧ 𝑜 ∈ 𝐽) → ((𝐴 ∈ 𝑜 → ∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅) ↔ (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅)))
33	32	ralbidva 3185	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴 ∈ 𝑋) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅)))
34	33	pm5.32da 590	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → ((𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑡 ∈ 𝐹 (𝑜 ∩ 𝑡) ≠ ∅)) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅))))
35	6, 34	bitrd 282	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → ∀𝑠 ∈ 𝐵 (𝑜 ∩ 𝑠) ≠ ∅))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  ∃wrex 3088   ∩ cin 3901   ⊆ wss 3902  ∅c0 4282  ‘cfv 6537  (class class class)co 7417  fBascfbas 21579  filGencfg 21580  TopOnctopon 23141  Filcfil 24077   fClus cfcls 24168

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-fbas 21588  df-fg 21589  df-top 23125  df-topon 23142  df-cld 23250  df-ntr 23251  df-cls 23252  df-fil 24078  df-fcls 24173

This theorem is used by: (None)