| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uffixsn | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| uffixsn | ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq2 2822 | . . 3 ⊢ (𝑥 = {𝐴} → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ {𝐴})) | |
| 2 | ufilfil 23839 | . . . . . . . 8 ⊢ (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋)) | |
| 3 | filn0 23797 | . . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅) | |
| 4 | intssuni 4922 | . . . . . . . 8 ⊢ (𝐹 ≠ ∅ → ∩ 𝐹 ⊆ ∪ 𝐹) | |
| 5 | 2, 3, 4 | 3syl 18 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ ∪ 𝐹) |
| 6 | filunibas 23816 | . . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋) | |
| 7 | 2, 6 | syl 17 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∪ 𝐹 = 𝑋) |
| 8 | 5, 7 | sseqtrd 3967 | . . . . . 6 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ 𝑋) |
| 9 | 8 | sselda 3930 | . . . . 5 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐴 ∈ 𝑋) |
| 10 | 9 | snssd 4762 | . . . 4 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ⊆ 𝑋) |
| 11 | snex 5378 | . . . . 5 ⊢ {𝐴} ∈ V | |
| 12 | 11 | elpw 4555 | . . . 4 ⊢ ({𝐴} ∈ 𝒫 𝑋 ↔ {𝐴} ⊆ 𝑋) |
| 13 | 10, 12 | sylibr 234 | . . 3 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ 𝒫 𝑋) |
| 14 | snidg 4614 | . . . 4 ⊢ (𝐴 ∈ ∩ 𝐹 → 𝐴 ∈ {𝐴}) | |
| 15 | 14 | adantl 481 | . . 3 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐴 ∈ {𝐴}) |
| 16 | 1, 13, 15 | elrabd 3645 | . 2 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) |
| 17 | uffixfr 23858 | . . 3 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐴 ∈ ∩ 𝐹 ↔ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})) | |
| 18 | 17 | biimpa 476 | . 2 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) |
| 19 | 16, 18 | eleqtrrd 2836 | 1 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2929 {crab 3396 ⊆ wss 3898 ∅c0 4282 𝒫 cpw 4551 {csn 4577 ∪ cuni 4860 ∩ cint 4899 ‘cfv 6489 Filcfil 23780 UFilcufil 23834 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-int 4900 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fv 6497 df-ov 7358 df-oprab 7359 df-mpo 7360 df-fbas 21297 df-fg 21298 df-fil 23781 df-ufil 23836 |
| This theorem is referenced by: ufildom1 23861 cfinufil 23863 fin1aufil 23867 |
| Copyright terms: Public domain | W3C validator |