| 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 23879 | . . . . . . . 8 ⊢ (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋)) | |
| 2 | filn0 23837 | . . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅) | |
| 3 | intssuni 4913 | . . . . . . . 8 ⊢ (𝐹 ≠ ∅ → ∩ 𝐹 ⊆ ∪ 𝐹) | |
| 4 | 1, 2, 3 | 3syl 18 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ ∪ 𝐹) |
| 5 | filunibas 23856 | . . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋) | |
| 6 | 1, 5 | syl 17 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∪ 𝐹 = 𝑋) |
| 7 | 4, 6 | sseqtrd 3959 | . . . . . 6 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ 𝑋) |
| 8 | 7 | sseld 3921 | . . . . 5 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 → 𝑥 ∈ 𝑋)) |
| 9 | 8 | pm4.71rd 562 | . . . 4 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 ↔ (𝑥 ∈ 𝑋 ∧ 𝑥 ∈ ∩ 𝐹))) |
| 10 | uffixfr 23898 | . . . . 5 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 ↔ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦})) | |
| 11 | 10 | anbi2d 631 | . . . 4 ⊢ (𝐹 ∈ (UFil‘𝑋) → ((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ ∩ 𝐹) ↔ (𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦}))) |
| 12 | 9, 11 | bitrd 279 | . . 3 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 ↔ (𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦}))) |
| 13 | 12 | exbidv 1923 | . 2 ⊢ (𝐹 ∈ (UFil‘𝑋) → (∃𝑥 𝑥 ∈ ∩ 𝐹 ↔ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦}))) |
| 14 | n0 4294 | . 2 ⊢ (∩ 𝐹 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ ∩ 𝐹) | |
| 15 | df-rex 3063 | . 2 ⊢ (∃𝑥 ∈ 𝑋 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦} ↔ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦})) | |
| 16 | 13, 14, 15 | 3bitr4g 314 | 1 ⊢ (𝐹 ∈ (UFil‘𝑋) → (∩ 𝐹 ≠ ∅ ↔ ∃𝑥 ∈ 𝑋 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ≠ wne 2933 ∃wrex 3062 {crab 3390 ⊆ wss 3890 ∅c0 4274 𝒫 cpw 4542 ∪ cuni 4851 ∩ cint 4890 ‘cfv 6492 Filcfil 23820 UFilcufil 23874 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-br 5087 df-opab 5149 df-mpt 5168 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 7363 df-oprab 7364 df-mpo 7365 df-fbas 21341 df-fg 21342 df-fil 23821 df-ufil 23876 |
| This theorem is referenced by: uffinfix 23902 |
| Copyright terms: Public domain | W3C validator |