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

Theorem uffixsn 24299
Description: The singleton of the generator of a fixed ultrafilter is in the filter. (Contributed by Mario Carneiro, 24-May-2015.) (Revised by Stefan O'Rear, 2-Aug-2015.)
Assertion
Ref Expression
uffixsn ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ 𝐹)

Proof of Theorem uffixsn
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eleq2 2853 . . 3 (𝑥 = {𝐴} → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ {𝐴}))
2 ufilfil 24278 . . . . . . . 8 (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
3 filn0 24236 . . . . . . . 8 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅)
4 intssuni 4935 . . . . . . . 8 (𝐹 ≠ ∅ → ∩ 𝐹 ⊆ ∪ 𝐹)
52, 3, 43syl 19 . . . . . . 7 (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ ∪ 𝐹)
6 filunibas 24255 . . . . . . . 8 (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋)
72, 6syl 18 . . . . . . 7 (𝐹 ∈ (UFil‘𝑋) → ∪ 𝐹 = 𝑋)
85, 7sseqtrd 3949 . . . . . 6 (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ 𝑋)
98sselda 3913 . . . . 5 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐴 ∈ 𝑋)
109snssd 4749 . . . 4 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ⊆ 𝑋)
11 snex 5404 . . . . 5 {𝐴} ∈ V
1211elpw 4564 . . . 4 ({𝐴} ∈ 𝒫 𝑋 ↔ {𝐴} ⊆ 𝑋)
1310, 12sylibr 237 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ 𝒫 𝑋)
14 snidg 4622 . . . 4 (𝐴 ∈ ∩ 𝐹 → 𝐴 ∈ {𝐴})
1514adantl 487 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐴 ∈ {𝐴})
161, 13, 15elrabd 3650 . 2 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})
17 uffixfr 24297 . . 3 (𝐹 ∈ (UFil‘𝑋) → (𝐴 ∈ ∩ 𝐹 ↔ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}))
1817biimpa 482 . 2 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})
1916, 18eleqtrrd 2867 1 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  {crab 3416   ⊆ wss 3900  ∅c0 4281  𝒫 cpw 4560  {csn 4588  ∪ cuni 4872  ∩ cint 4912  ‘cfv 6566  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:  ufildom1  24300  cfinufil  24302  fin1aufil  24306
  Copyright terms: Public domain W3C validator