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

Theorem uffixsn 24151
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 2849 . . 3 (𝑥 = {𝐴} → (𝐴𝑥𝐴 ∈ {𝐴}))
2 ufilfil 24130 . . . . . . . 8 (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
3 filn0 24088 . . . . . . . 8 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅)
4 intssuni 4930 . . . . . . . 8 (𝐹 ≠ ∅ → 𝐹 𝐹)
52, 3, 43syl 19 . . . . . . 7 (𝐹 ∈ (UFil‘𝑋) → 𝐹 𝐹)
6 filunibas 24107 . . . . . . . 8 (𝐹 ∈ (Fil‘𝑋) → 𝐹 = 𝑋)
72, 6syl 18 . . . . . . 7 (𝐹 ∈ (UFil‘𝑋) → 𝐹 = 𝑋)
85, 7sseqtrd 3967 . . . . . 6 (𝐹 ∈ (UFil‘𝑋) → 𝐹𝑋)
98sselda 3931 . . . . 5 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 𝐹) → 𝐴𝑋)
109snssd 4747 . . . 4 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 𝐹) → {𝐴} ⊆ 𝑋)
11 snex 5404 . . . . 5 {𝐴} ∈ V
1211elpw 4561 . . . 4 ({𝐴} ∈ 𝒫 𝑋 ↔ {𝐴} ⊆ 𝑋)
1310, 12sylibr 237 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 𝐹) → {𝐴} ∈ 𝒫 𝑋)
14 snidg 4621 . . . 4 (𝐴 𝐹𝐴 ∈ {𝐴})
1514adantl 487 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 𝐹) → 𝐴 ∈ {𝐴})
161, 13, 15elrabd 3647 . 2 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 𝐹) → {𝐴} ∈ {𝑥 ∈ 𝒫 𝑋𝐴𝑥})
17 uffixfr 24149 . . 3 (𝐹 ∈ (UFil‘𝑋) → (𝐴 𝐹𝐹 = {𝑥 ∈ 𝒫 𝑋𝐴𝑥}))
1817biimpa 482 . 2 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 𝐹) → 𝐹 = {𝑥 ∈ 𝒫 𝑋𝐴𝑥})
1916, 18eleqtrrd 2863 1 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 𝐹) → {𝐴} ∈ 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wne 2955  {crab 3412  wss 3899  c0 4279  𝒫 cpw 4557  {csn 4584   cuni 4867   cint 4907  cfv 6533  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
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-int 4908  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-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-fbas 21582  df-fg 21583  df-fil 24072  df-ufil 24127
This theorem is used by:  ufildom1  24152  cfinufil  24154  fin1aufil  24158
  Copyright terms: Public domain W3C validator