Theorem ufildr 24157

Description: An ultrafilter gives rise to a connected door topology. (Contributed by Jeff Hankins, 6-Dec-2009.) (Revised by Stefan O'Rear, 3-Aug-2015.)

Hypothesis

Ref	Expression
ufildr.1	⊢ 𝐽 = (𝐹 ∪ {∅})

Assertion

Ref	Expression
ufildr	⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐽 ∪ (Clsd‘𝐽)) = 𝒫 𝑋)

Proof of Theorem ufildr

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elssuni 4899	. . . . . 6 ⊢ (𝑥 ∈ 𝐽 → 𝑥 ⊆ ∪ 𝐽)
2		ufilfil 24130	. . . . . . . . 9 ⊢ (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
3		filunibas 24107	. . . . . . . . 9 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋)
4	2, 3	syl 18	. . . . . . . 8 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∪ 𝐹 = 𝑋)
5		ufildr.1	. . . . . . . . . 10 ⊢ 𝐽 = (𝐹 ∪ {∅})
6	5	unieqi 4879	. . . . . . . . 9 ⊢ ∪ 𝐽 = ∪ (𝐹 ∪ {∅})
7		uniun 4890	. . . . . . . . . 10 ⊢ ∪ (𝐹 ∪ {∅}) = (∪ 𝐹 ∪ ∪ {∅})
8		0ex 5264	. . . . . . . . . . . 12 ⊢ ∅ ∈ V
9	8	unisn 4886	. . . . . . . . . . 11 ⊢ ∪ {∅} = ∅
10	9	uneq2i 4112	. . . . . . . . . 10 ⊢ (∪ 𝐹 ∪ ∪ {∅}) = (∪ 𝐹 ∪ ∅)
11		un0 4344	. . . . . . . . . 10 ⊢ (∪ 𝐹 ∪ ∅) = ∪ 𝐹
12	7, 10, 11	3eqtri 2787	. . . . . . . . 9 ⊢ ∪ (𝐹 ∪ {∅}) = ∪ 𝐹
13	6, 12	eqtr2i 2784	. . . . . . . 8 ⊢ ∪ 𝐹 = ∪ 𝐽
14	4, 13	eqtr3di 2810	. . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → 𝑋 = ∪ 𝐽)
15	14	sseq2d 3963	. . . . . 6 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ⊆ 𝑋 ↔ 𝑥 ⊆ ∪ 𝐽))
16	1, 15	imbitrrid 249	. . . . 5 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ 𝐽 → 𝑥 ⊆ 𝑋))
17		eqid 2760	. . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽
18	17	cldss 23254	. . . . . 6 ⊢ (𝑥 ∈ (Clsd‘𝐽) → 𝑥 ⊆ ∪ 𝐽)
19	18, 15	imbitrrid 249	. . . . 5 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (Clsd‘𝐽) → 𝑥 ⊆ 𝑋))
20	16, 19	jaod 873	. . . 4 ⊢ (𝐹 ∈ (UFil‘𝑋) → ((𝑥 ∈ 𝐽 ∨ 𝑥 ∈ (Clsd‘𝐽)) → 𝑥 ⊆ 𝑋))
21		ufilss 24131	. . . . . 6 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → (𝑥 ∈ 𝐹 ∨ (𝑋 ∖ 𝑥) ∈ 𝐹))
22		ssun1 4124	. . . . . . . . . 10 ⊢ 𝐹 ⊆ (𝐹 ∪ {∅})
23	22, 5	sseqtrri 3980	. . . . . . . . 9 ⊢ 𝐹 ⊆ 𝐽
24	23	a1i 11	. . . . . . . 8 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → 𝐹 ⊆ 𝐽)
25	24	sseld 3930	. . . . . . 7 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → (𝑥 ∈ 𝐹 → 𝑥 ∈ 𝐽))
26	24	sseld 3930	. . . . . . . 8 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → ((𝑋 ∖ 𝑥) ∈ 𝐹 → (𝑋 ∖ 𝑥) ∈ 𝐽))
27		filconn 24109	. . . . . . . . . . . 12 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝐹 ∪ {∅}) ∈ Conn)
28		conntop 23642	. . . . . . . . . . . 12 ⊢ ((𝐹 ∪ {∅}) ∈ Conn → (𝐹 ∪ {∅}) ∈ Top)
29	2, 27, 28	3syl 19	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐹 ∪ {∅}) ∈ Top)
30	5, 29	eqeltrid 2864	. . . . . . . . . 10 ⊢ (𝐹 ∈ (UFil‘𝑋) → 𝐽 ∈ Top)
31	15	biimpa 482	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → 𝑥 ⊆ ∪ 𝐽)
32	17	iscld2 23253	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ ∪ 𝐽) → (𝑥 ∈ (Clsd‘𝐽) ↔ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽))
33	30, 31, 32	syl2an2r 698	. . . . . . . . 9 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → (𝑥 ∈ (Clsd‘𝐽) ↔ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽))
34	14	difeq1d 4073	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑋 ∖ 𝑥) = (∪ 𝐽 ∖ 𝑥))
35	34	eleq1d 2845	. . . . . . . . . 10 ⊢ (𝐹 ∈ (UFil‘𝑋) → ((𝑋 ∖ 𝑥) ∈ 𝐽 ↔ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽))
36	35	adantr 486	. . . . . . . . 9 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → ((𝑋 ∖ 𝑥) ∈ 𝐽 ↔ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽))
37	33, 36	bitr4d 285	. . . . . . . 8 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → (𝑥 ∈ (Clsd‘𝐽) ↔ (𝑋 ∖ 𝑥) ∈ 𝐽))
38	26, 37	sylibrd 262	. . . . . . 7 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → ((𝑋 ∖ 𝑥) ∈ 𝐹 → 𝑥 ∈ (Clsd‘𝐽)))
39	25, 38	orim12d 979	. . . . . 6 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → ((𝑥 ∈ 𝐹 ∨ (𝑋 ∖ 𝑥) ∈ 𝐹) → (𝑥 ∈ 𝐽 ∨ 𝑥 ∈ (Clsd‘𝐽))))
40	21, 39	mpd 16	. . . . 5 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → (𝑥 ∈ 𝐽 ∨ 𝑥 ∈ (Clsd‘𝐽)))
41	40	ex 418	. . . 4 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ⊆ 𝑋 → (𝑥 ∈ 𝐽 ∨ 𝑥 ∈ (Clsd‘𝐽))))
42	20, 41	impbid 215	. . 3 ⊢ (𝐹 ∈ (UFil‘𝑋) → ((𝑥 ∈ 𝐽 ∨ 𝑥 ∈ (Clsd‘𝐽)) ↔ 𝑥 ⊆ 𝑋))
43		elun 4100	. . 3 ⊢ (𝑥 ∈ (𝐽 ∪ (Clsd‘𝐽)) ↔ (𝑥 ∈ 𝐽 ∨ 𝑥 ∈ (Clsd‘𝐽)))
44		velpw 4562	. . 3 ⊢ (𝑥 ∈ 𝒫 𝑋 ↔ 𝑥 ⊆ 𝑋)
45	42, 43, 44	3bitr4g 317	. 2 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (𝐽 ∪ (Clsd‘𝐽)) ↔ 𝑥 ∈ 𝒫 𝑋))
46	45	eqrdv 2758	1 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐽 ∪ (Clsd‘𝐽)) = 𝒫 𝑋)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ∖ cdif 3896   ∪ cun 3897   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  {csn 4584  ∪ cuni 4867  ‘cfv 6533  Topctop 23118  Clsdccld 23241  Conncconn 23636  Filcfil 24071  UFilcufil 24125

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-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-nel 3062  df-ral 3077  df-rex 3087  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-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-fv 6541  df-fbas 21582  df-top 23119  df-cld 23244  df-conn 23637  df-fil 24072  df-ufil 24127

This theorem is used by: (None)