Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ufildom1 | Structured version Visualization version GIF version |
Description: An ultrafilter is generated by at most one element (because free ultrafilters have no generators and fixed ultrafilters have exactly one). (Contributed by Mario Carneiro, 24-May-2015.) (Revised by Stefan O'Rear, 2-Aug-2015.) |
Ref | Expression |
---|---|
ufildom1 | ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ≼ 1o) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq1 5073 | . 2 ⊢ (∩ 𝐹 = ∅ → (∩ 𝐹 ≼ 1o ↔ ∅ ≼ 1o)) | |
2 | uffixsn 22984 | . . . . . . . . 9 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ ∩ 𝐹) → {𝑥} ∈ 𝐹) | |
3 | intss1 4891 | . . . . . . . . 9 ⊢ ({𝑥} ∈ 𝐹 → ∩ 𝐹 ⊆ {𝑥}) | |
4 | 2, 3 | syl 17 | . . . . . . . 8 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ ∩ 𝐹) → ∩ 𝐹 ⊆ {𝑥}) |
5 | simpr 484 | . . . . . . . . 9 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ ∩ 𝐹) → 𝑥 ∈ ∩ 𝐹) | |
6 | 5 | snssd 4739 | . . . . . . . 8 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ ∩ 𝐹) → {𝑥} ⊆ ∩ 𝐹) |
7 | 4, 6 | eqssd 3934 | . . . . . . 7 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ ∩ 𝐹) → ∩ 𝐹 = {𝑥}) |
8 | 7 | ex 412 | . . . . . 6 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ ∩ 𝐹 → ∩ 𝐹 = {𝑥})) |
9 | 8 | eximdv 1921 | . . . . 5 ⊢ (𝐹 ∈ (UFil‘𝑋) → (∃𝑥 𝑥 ∈ ∩ 𝐹 → ∃𝑥∩ 𝐹 = {𝑥})) |
10 | n0 4277 | . . . . 5 ⊢ (∩ 𝐹 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ ∩ 𝐹) | |
11 | en1 8765 | . . . . 5 ⊢ (∩ 𝐹 ≈ 1o ↔ ∃𝑥∩ 𝐹 = {𝑥}) | |
12 | 9, 10, 11 | 3imtr4g 295 | . . . 4 ⊢ (𝐹 ∈ (UFil‘𝑋) → (∩ 𝐹 ≠ ∅ → ∩ 𝐹 ≈ 1o)) |
13 | 12 | imp 406 | . . 3 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ ∩ 𝐹 ≠ ∅) → ∩ 𝐹 ≈ 1o) |
14 | endom 8722 | . . 3 ⊢ (∩ 𝐹 ≈ 1o → ∩ 𝐹 ≼ 1o) | |
15 | 13, 14 | syl 17 | . 2 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ ∩ 𝐹 ≠ ∅) → ∩ 𝐹 ≼ 1o) |
16 | 1on 8274 | . . 3 ⊢ 1o ∈ On | |
17 | 0domg 8840 | . . 3 ⊢ (1o ∈ On → ∅ ≼ 1o) | |
18 | 16, 17 | mp1i 13 | . 2 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∅ ≼ 1o) |
19 | 1, 15, 18 | pm2.61ne 3029 | 1 ⊢ (𝐹 ∈ (UFil‘𝑋) → ∩ 𝐹 ≼ 1o) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∃wex 1783 ∈ wcel 2108 ≠ wne 2942 ⊆ wss 3883 ∅c0 4253 {csn 4558 ∩ cint 4876 class class class wbr 5070 Oncon0 6251 ‘cfv 6418 1oc1o 8260 ≈ cen 8688 ≼ cdom 8689 UFilcufil 22958 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-ord 6254 df-on 6255 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-1o 8267 df-en 8692 df-dom 8693 df-fbas 20507 df-fg 20508 df-fil 22905 df-ufil 22960 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |