| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uffix2 | Structured version Visualization version GIF version | ||
| Description: A classification of fixed ultrafilters. (Contributed by Mario Carneiro, 24-May-2015.) (Revised by Stefan O'Rear, 2-Aug-2015.) |
| Ref | Expression |
|---|---|
| uffix2 | ⊢ (𝐹 ∈ (UFil‘𝑋) → (∩ 𝐹 ≠ ∅ ↔ ∃𝑥 ∈ 𝑋 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ufilfil 23798 | . . . . . . . 8 ⊢ (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋)) | |
| 2 | filn0 23756 | . . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅) | |
| 3 | intssuni 4937 | . . . . . . . 8 ⊢ (𝐹 ≠ ∅ → ∩ 𝐹 ⊆ ∪ 𝐹) | |
| 4 | 1, 2, 3 | 3syl 18 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ ∪ 𝐹) |
| 5 | filunibas 23775 | . . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋) | |
| 6 | 1, 5 | syl 17 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∪ 𝐹 = 𝑋) |
| 7 | 4, 6 | sseqtrd 3986 | . . . . . 6 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ 𝑋) |
| 8 | 7 | sseld 3948 | . . . . 5 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 → 𝑥 ∈ 𝑋)) |
| 9 | 8 | pm4.71rd 562 | . . . 4 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 ↔ (𝑥 ∈ 𝑋 ∧ 𝑥 ∈ ∩ 𝐹))) |
| 10 | uffixfr 23817 | . . . . 5 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 ↔ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦})) | |
| 11 | 10 | anbi2d 630 | . . . 4 ⊢ (𝐹 ∈ (UFil‘𝑋) → ((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ ∩ 𝐹) ↔ (𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦}))) |
| 12 | 9, 11 | bitrd 279 | . . 3 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 ↔ (𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦}))) |
| 13 | 12 | exbidv 1921 | . 2 ⊢ (𝐹 ∈ (UFil‘𝑋) → (∃𝑥 𝑥 ∈ ∩ 𝐹 ↔ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦}))) |
| 14 | n0 4319 | . 2 ⊢ (∩ 𝐹 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ ∩ 𝐹) | |
| 15 | df-rex 3055 | . 2 ⊢ (∃𝑥 ∈ 𝑋 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦} ↔ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦})) | |
| 16 | 13, 14, 15 | 3bitr4g 314 | 1 ⊢ (𝐹 ∈ (UFil‘𝑋) → (∩ 𝐹 ≠ ∅ ↔ ∃𝑥 ∈ 𝑋 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ≠ wne 2926 ∃wrex 3054 {crab 3408 ⊆ wss 3917 ∅c0 4299 𝒫 cpw 4566 ∪ cuni 4874 ∩ cint 4913 ‘cfv 6514 Filcfil 23739 UFilcufil 23793 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fv 6522 df-ov 7393 df-oprab 7394 df-mpo 7395 df-fbas 21268 df-fg 21269 df-fil 23740 df-ufil 23795 |
| This theorem is referenced by: uffinfix 23821 |
| Copyright terms: Public domain | W3C validator |