| 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 24229 | . . . . . . . 8 ⊢ (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋)) | |
| 2 | filn0 24187 | . . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅) | |
| 3 | intssuni 4929 | . . . . . . . 8 ⊢ (𝐹 ≠ ∅ → ∩ 𝐹 ⊆ ∪ 𝐹) | |
| 4 | 1, 2, 3 | 3syl 19 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ ∪ 𝐹) |
| 5 | filunibas 24206 | . . . . . . . 8 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋) | |
| 6 | 1, 5 | syl 18 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∪ 𝐹 = 𝑋) |
| 7 | 4, 6 | sseqtrd 3944 | . . . . . 6 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ⊆ 𝑋) |
| 8 | 7 | sseld 3907 | . . . . 5 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 → 𝑥 ∈ 𝑋)) |
| 9 | 8 | pm4.71rd 572 | . . . 4 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 ↔ (𝑥 ∈ 𝑋 ∧ 𝑥 ∈ ∩ 𝐹))) |
| 10 | uffixfr 24248 | . . . . 5 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 ↔ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦})) | |
| 11 | 10 | anbi2d 642 | . . . 4 ⊢ (𝐹 ∈ (UFil‘𝑋) → ((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ ∩ 𝐹) ↔ (𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦}))) |
| 12 | 9, 11 | bitrd 282 | . . 3 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 ↔ (𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦}))) |
| 13 | 12 | exbidv 1953 | . 2 ⊢ (𝐹 ∈ (UFil‘𝑋) → (∃𝑥 𝑥 ∈ ∩ 𝐹 ↔ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦}))) |
| 14 | n0 4299 | . 2 ⊢ (∩ 𝐹 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ ∩ 𝐹) | |
| 15 | df-rex 3087 | . 2 ⊢ (∃𝑥 ∈ 𝑋 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦} ↔ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦})) | |
| 16 | 13, 14, 15 | 3bitr4g 317 | 1 ⊢ (𝐹 ∈ (UFil‘𝑋) → (∩ 𝐹 ≠ ∅ ↔ ∃𝑥 ∈ 𝑋 𝐹 = {𝑦 ∈ 𝒫 𝑋 ∣ 𝑥 ∈ 𝑦})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∃wex 1811 ∈ wcel 2144 ≠ wne 2955 ∃wrex 3086 {crab 3412 ⊆ wss 3895 ∅c0 4278 𝒫 cpw 4556 ∪ cuni 4866 ∩ cint 4906 ‘cfv 6539 Filcfil 24170 UFilcufil 24224 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-fbas 21681 df-fg 21682 df-fil 24171 df-ufil 24226 |
| This theorem is used by: uffinfix 24252 |
| Copyright terms: Public domain | W3C validator |