MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ufildr Structured version   Visualization version   GIF version

Theorem ufildr 22106
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.
StepHypRef Expression
1 elssuni 4690 . . . . . 6 (𝑥𝐽𝑥 𝐽)
2 ufildr.1 . . . . . . . . . 10 𝐽 = (𝐹 ∪ {∅})
32unieqi 4668 . . . . . . . . 9 𝐽 = (𝐹 ∪ {∅})
4 uniun 4680 . . . . . . . . . 10 (𝐹 ∪ {∅}) = ( 𝐹 {∅})
5 0ex 5015 . . . . . . . . . . . 12 ∅ ∈ V
65unisn 4675 . . . . . . . . . . 11 {∅} = ∅
76uneq2i 3992 . . . . . . . . . 10 ( 𝐹 {∅}) = ( 𝐹 ∪ ∅)
8 un0 4193 . . . . . . . . . 10 ( 𝐹 ∪ ∅) = 𝐹
94, 7, 83eqtri 2854 . . . . . . . . 9 (𝐹 ∪ {∅}) = 𝐹
103, 9eqtr2i 2851 . . . . . . . 8 𝐹 = 𝐽
11 ufilfil 22079 . . . . . . . . 9 (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
12 filunibas 22056 . . . . . . . . 9 (𝐹 ∈ (Fil‘𝑋) → 𝐹 = 𝑋)
1311, 12syl 17 . . . . . . . 8 (𝐹 ∈ (UFil‘𝑋) → 𝐹 = 𝑋)
1410, 13syl5reqr 2877 . . . . . . 7 (𝐹 ∈ (UFil‘𝑋) → 𝑋 = 𝐽)
1514sseq2d 3859 . . . . . 6 (𝐹 ∈ (UFil‘𝑋) → (𝑥𝑋𝑥 𝐽))
161, 15syl5ibr 238 . . . . 5 (𝐹 ∈ (UFil‘𝑋) → (𝑥𝐽𝑥𝑋))
17 eqid 2826 . . . . . . 7 𝐽 = 𝐽
1817cldss 21205 . . . . . 6 (𝑥 ∈ (Clsd‘𝐽) → 𝑥 𝐽)
1918, 15syl5ibr 238 . . . . 5 (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (Clsd‘𝐽) → 𝑥𝑋))
2016, 19jaod 892 . . . 4 (𝐹 ∈ (UFil‘𝑋) → ((𝑥𝐽𝑥 ∈ (Clsd‘𝐽)) → 𝑥𝑋))
21 ufilss 22080 . . . . . 6 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → (𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹))
22 ssun1 4004 . . . . . . . . . 10 𝐹 ⊆ (𝐹 ∪ {∅})
2322, 2sseqtr4i 3864 . . . . . . . . 9 𝐹𝐽
2423a1i 11 . . . . . . . 8 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → 𝐹𝐽)
2524sseld 3827 . . . . . . 7 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → (𝑥𝐹𝑥𝐽))
2624sseld 3827 . . . . . . . 8 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → ((𝑋𝑥) ∈ 𝐹 → (𝑋𝑥) ∈ 𝐽))
27 filconn 22058 . . . . . . . . . . . . 13 (𝐹 ∈ (Fil‘𝑋) → (𝐹 ∪ {∅}) ∈ Conn)
28 conntop 21592 . . . . . . . . . . . . 13 ((𝐹 ∪ {∅}) ∈ Conn → (𝐹 ∪ {∅}) ∈ Top)
2911, 27, 283syl 18 . . . . . . . . . . . 12 (𝐹 ∈ (UFil‘𝑋) → (𝐹 ∪ {∅}) ∈ Top)
302, 29syl5eqel 2911 . . . . . . . . . . 11 (𝐹 ∈ (UFil‘𝑋) → 𝐽 ∈ Top)
3130adantr 474 . . . . . . . . . 10 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → 𝐽 ∈ Top)
3215biimpa 470 . . . . . . . . . 10 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → 𝑥 𝐽)
3317iscld2 21204 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ 𝑥 𝐽) → (𝑥 ∈ (Clsd‘𝐽) ↔ ( 𝐽𝑥) ∈ 𝐽))
3431, 32, 33syl2anc 581 . . . . . . . . 9 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → (𝑥 ∈ (Clsd‘𝐽) ↔ ( 𝐽𝑥) ∈ 𝐽))
3514difeq1d 3955 . . . . . . . . . . 11 (𝐹 ∈ (UFil‘𝑋) → (𝑋𝑥) = ( 𝐽𝑥))
3635eleq1d 2892 . . . . . . . . . 10 (𝐹 ∈ (UFil‘𝑋) → ((𝑋𝑥) ∈ 𝐽 ↔ ( 𝐽𝑥) ∈ 𝐽))
3736adantr 474 . . . . . . . . 9 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → ((𝑋𝑥) ∈ 𝐽 ↔ ( 𝐽𝑥) ∈ 𝐽))
3834, 37bitr4d 274 . . . . . . . 8 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → (𝑥 ∈ (Clsd‘𝐽) ↔ (𝑋𝑥) ∈ 𝐽))
3926, 38sylibrd 251 . . . . . . 7 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → ((𝑋𝑥) ∈ 𝐹𝑥 ∈ (Clsd‘𝐽)))
4025, 39orim12d 994 . . . . . 6 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → ((𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹) → (𝑥𝐽𝑥 ∈ (Clsd‘𝐽))))
4121, 40mpd 15 . . . . 5 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥𝑋) → (𝑥𝐽𝑥 ∈ (Clsd‘𝐽)))
4241ex 403 . . . 4 (𝐹 ∈ (UFil‘𝑋) → (𝑥𝑋 → (𝑥𝐽𝑥 ∈ (Clsd‘𝐽))))
4320, 42impbid 204 . . 3 (𝐹 ∈ (UFil‘𝑋) → ((𝑥𝐽𝑥 ∈ (Clsd‘𝐽)) ↔ 𝑥𝑋))
44 elun 3981 . . 3 (𝑥 ∈ (𝐽 ∪ (Clsd‘𝐽)) ↔ (𝑥𝐽𝑥 ∈ (Clsd‘𝐽)))
45 selpw 4386 . . 3 (𝑥 ∈ 𝒫 𝑋𝑥𝑋)
4643, 44, 453bitr4g 306 . 2 (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (𝐽 ∪ (Clsd‘𝐽)) ↔ 𝑥 ∈ 𝒫 𝑋))
4746eqrdv 2824 1 (𝐹 ∈ (UFil‘𝑋) → (𝐽 ∪ (Clsd‘𝐽)) = 𝒫 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wa 386  wo 880   = wceq 1658  wcel 2166  cdif 3796  cun 3797  wss 3799  c0 4145  𝒫 cpw 4379  {csn 4398   cuni 4659  cfv 6124  Topctop 21069  Clsdccld 21192  Conncconn 21586  Filcfil 22020  UFilcufil 22074
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-8 2168  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2804  ax-sep 5006  ax-nul 5014  ax-pow 5066  ax-pr 5128  ax-un 7210
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2606  df-eu 2641  df-clab 2813  df-cleq 2819  df-clel 2822  df-nfc 2959  df-ne 3001  df-nel 3104  df-ral 3123  df-rex 3124  df-rab 3127  df-v 3417  df-sbc 3664  df-csb 3759  df-dif 3802  df-un 3804  df-in 3806  df-ss 3813  df-nul 4146  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4660  df-br 4875  df-opab 4937  df-mpt 4954  df-id 5251  df-xp 5349  df-rel 5350  df-cnv 5351  df-co 5352  df-dm 5353  df-rn 5354  df-res 5355  df-ima 5356  df-iota 6087  df-fun 6126  df-fn 6127  df-fv 6132  df-fbas 20104  df-top 21070  df-cld 21195  df-conn 21587  df-fil 22021  df-ufil 22076
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator