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

Theorem uffixfr 24297
Description: An ultrafilter is either fixed or free. A fixed ultrafilter is called principal (generated by a single element 𝐴), and a free ultrafilter is called nonprincipal (having empty intersection). Note that examples of free ultrafilters cannot be defined in ZFC without some form of global choice. (Contributed by Jeff Hankins, 4-Dec-2009.) (Revised by Stefan O'Rear, 2-Aug-2015.)
Assertion
Ref Expression
uffixfr (𝐹 ∈ (UFil‘𝑋) → (𝐴 ∈ ∩ 𝐹 ↔ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝑋

Proof of Theorem uffixfr
StepHypRef Expression
1 simpl 488 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐹 ∈ (UFil‘𝑋))
2 ufilfil 24278 . . . . . . 7 (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
3 filtop 24229 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → 𝑋 ∈ 𝐹)
42, 3syl 18 . . . . . 6 (𝐹 ∈ (UFil‘𝑋) → 𝑋 ∈ 𝐹)
5 filn0 24236 . . . . . . . . 9 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅)
6 intssuni 4935 . . . . . . . . 9 (𝐹 ≠ ∅ → ∩ 𝐹 ⊆ ∪ 𝐹)
72, 5, 63syl 19 . . . . . . . 8 (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ ∪ 𝐹)
8 filunibas 24255 . . . . . . . . 9 (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋)
92, 8syl 18 . . . . . . . 8 (𝐹 ∈ (UFil‘𝑋) → ∪ 𝐹 = 𝑋)
107, 9sseqtrd 3949 . . . . . . 7 (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ 𝑋)
1110sselda 3913 . . . . . 6 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐴 ∈ 𝑋)
12 uffix 24295 . . . . . 6 ((𝑋 ∈ 𝐹 ∧ 𝐴 ∈ 𝑋) → ({{𝐴}} ∈ (fBas‘𝑋) ∧ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} = (𝑋filGen{{𝐴}})))
134, 11, 12syl2an2r 698 . . . . 5 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → ({{𝐴}} ∈ (fBas‘𝑋) ∧ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} = (𝑋filGen{{𝐴}})))
1413simprd 501 . . . 4 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} = (𝑋filGen{{𝐴}}))
1513simpld 500 . . . . 5 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {{𝐴}} ∈ (fBas‘𝑋))
16 fgcl 24252 . . . . 5 ({{𝐴}} ∈ (fBas‘𝑋) → (𝑋filGen{{𝐴}}) ∈ (Fil‘𝑋))
1715, 16syl 18 . . . 4 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → (𝑋filGen{{𝐴}}) ∈ (Fil‘𝑋))
1814, 17eqeltrd 2864 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} ∈ (Fil‘𝑋))
192adantr 486 . . . . 5 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐹 ∈ (Fil‘𝑋))
20 filsspw 24225 . . . . 5 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ⊆ 𝒫 𝑋)
2119, 20syl 18 . . . 4 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐹 ⊆ 𝒫 𝑋)
22 elintg 4920 . . . . . 6 (𝐴 ∈ ∩ 𝐹 → (𝐴 ∈ ∩ 𝐹 ↔ ∀𝑥 ∈ 𝐹 𝐴 ∈ 𝑥))
2322ibi 270 . . . . 5 (𝐴 ∈ ∩ 𝐹 → ∀𝑥 ∈ 𝐹 𝐴 ∈ 𝑥)
2423adantl 487 . . . 4 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → ∀𝑥 ∈ 𝐹 𝐴 ∈ 𝑥)
25 ssrab 3999 . . . 4 (𝐹 ⊆ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} ↔ (𝐹 ⊆ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝐹 𝐴 ∈ 𝑥))
2621, 24, 25sylanbrc 595 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐹 ⊆ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})
27 ufilmax 24281 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) → 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})
281, 18, 26, 27syl3anc 1399 . 2 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})
29 eqimss 3971 . . . . 5 (𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} → 𝐹 ⊆ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})
3029adantl 487 . . . 4 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) → 𝐹 ⊆ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})
3125simprbi 503 . . . 4 (𝐹 ⊆ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} → ∀𝑥 ∈ 𝐹 𝐴 ∈ 𝑥)
3230, 31syl 18 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) → ∀𝑥 ∈ 𝐹 𝐴 ∈ 𝑥)
33 eleq2 2853 . . . . . 6 (𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} → (𝑋 ∈ 𝐹 ↔ 𝑋 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}))
3433biimpac 484 . . . . 5 ((𝑋 ∈ 𝐹 ∧ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) → 𝑋 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})
354, 34sylan 592 . . . 4 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) → 𝑋 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})
36 eleq2 2853 . . . . . 6 (𝑥 = 𝑋 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝑋))
3736elrab 3648 . . . . 5 (𝑋 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} ↔ (𝑋 ∈ 𝒫 𝑋 ∧ 𝐴 ∈ 𝑋))
3837simprbi 503 . . . 4 (𝑋 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥} → 𝐴 ∈ 𝑋)
39 elintg 4920 . . . 4 (𝐴 ∈ 𝑋 → (𝐴 ∈ ∩ 𝐹 ↔ ∀𝑥 ∈ 𝐹 𝐴 ∈ 𝑥))
4035, 38, 393syl 19 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) → (𝐴 ∈ ∩ 𝐹 ↔ ∀𝑥 ∈ 𝐹 𝐴 ∈ 𝑥))
4132, 40mpbird 260 . 2 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) → 𝐴 ∈ ∩ 𝐹)
4228, 41impbida 813 1 (𝐹 ∈ (UFil‘𝑋) → (𝐴 ∈ ∩ 𝐹 ↔ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  {crab 3416   ⊆ wss 3900  ∅c0 4281  𝒫 cpw 4560  {csn 4588  ∪ cuni 4872  ∩ cint 4912  ‘cfv 6566  (class class class)co 7451  fBascfbas 21717  filGencfg 21718  Filcfil 24219  UFilcufil 24273
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-fbas 21726  df-fg 21727  df-fil 24220  df-ufil 24275
This theorem is used by:  uffix2  24298  uffixsn  24299
  Copyright terms: Public domain W3C validator