| 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 2825 | . . 3 ⊢ (𝑥 = {𝐴} → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ {𝐴})) | |
| 2 | ufilfil 23848 | . . . . . . . 8 ⊢ (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋)) | |
| 3 | filn0 23806 | . . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅) | |
| 4 | intssuni 4925 | . . . . . . . 8 ⊢ (𝐹 ≠ ∅ → ∩ 𝐹 ⊆ ∪ 𝐹) | |
| 5 | 2, 3, 4 | 3syl 18 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ ∪ 𝐹) |
| 6 | filunibas 23825 | . . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋) | |
| 7 | 2, 6 | syl 17 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∪ 𝐹 = 𝑋) |
| 8 | 5, 7 | sseqtrd 3970 | . . . . . 6 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ 𝑋) |
| 9 | 8 | sselda 3933 | . . . . 5 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐴 ∈ 𝑋) |
| 10 | 9 | snssd 4765 | . . . 4 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ⊆ 𝑋) |
| 11 | snex 5381 | . . . . 5 ⊢ {𝐴} ∈ V | |
| 12 | 11 | elpw 4558 | . . . 4 ⊢ ({𝐴} ∈ 𝒫 𝑋 ↔ {𝐴} ⊆ 𝑋) |
| 13 | 10, 12 | sylibr 234 | . . 3 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ 𝒫 𝑋) |
| 14 | snidg 4617 | . . . 4 ⊢ (𝐴 ∈ ∩ 𝐹 → 𝐴 ∈ {𝐴}) | |
| 15 | 14 | adantl 481 | . . 3 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐴 ∈ {𝐴}) |
| 16 | 1, 13, 15 | elrabd 3648 | . 2 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) |
| 17 | uffixfr 23867 | . . 3 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐴 ∈ ∩ 𝐹 ↔ 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥})) | |
| 18 | 17 | biimpa 476 | . 2 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → 𝐹 = {𝑥 ∈ 𝒫 𝑋 ∣ 𝐴 ∈ 𝑥}) |
| 19 | 16, 18 | eleqtrrd 2839 | 1 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐴 ∈ ∩ 𝐹) → {𝐴} ∈ 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 {crab 3399 ⊆ wss 3901 ∅c0 4285 𝒫 cpw 4554 {csn 4580 ∪ cuni 4863 ∩ cint 4902 ‘cfv 6492 Filcfil 23789 UFilcufil 23843 |
| 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 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-fbas 21306 df-fg 21307 df-fil 23790 df-ufil 23845 |
| This theorem is referenced by: ufildom1 23870 cfinufil 23872 fin1aufil 23876 |
| Copyright terms: Public domain | W3C validator |