| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zfbas | Structured version Visualization version GIF version | ||
| Description: The set of upper sets of integers is a filter base on ℤ, which corresponds to convergence of sequences on ℤ. (Contributed by Mario Carneiro, 13-Oct-2015.) |
| Ref | Expression |
|---|---|
| zfbas | ⊢ ran ℤ≥ ∈ (fBas‘ℤ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uzf 12856 | . . 3 ⊢ ℤ≥:ℤ⟶𝒫 ℤ | |
| 2 | frn 6703 | . . 3 ⊢ (ℤ≥:ℤ⟶𝒫 ℤ → ran ℤ≥ ⊆ 𝒫 ℤ) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ran ℤ≥ ⊆ 𝒫 ℤ |
| 4 | ffn 6695 | . . . . . 6 ⊢ (ℤ≥:ℤ⟶𝒫 ℤ → ℤ≥ Fn ℤ) | |
| 5 | 1, 4 | ax-mp 5 | . . . . 5 ⊢ ℤ≥ Fn ℤ |
| 6 | 1z 12615 | . . . . 5 ⊢ 1 ∈ ℤ | |
| 7 | fnfvelrn 7065 | . . . . 5 ⊢ ((ℤ≥ Fn ℤ ∧ 1 ∈ ℤ) → (ℤ≥‘1) ∈ ran ℤ≥) | |
| 8 | 5, 6, 7 | mp2an 704 | . . . 4 ⊢ (ℤ≥‘1) ∈ ran ℤ≥ |
| 9 | 8 | ne0ii 4299 | . . 3 ⊢ ran ℤ≥ ≠ ∅ |
| 10 | uzid 12868 | . . . . . . 7 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ (ℤ≥‘𝑥)) | |
| 11 | n0i 4295 | . . . . . . 7 ⊢ (𝑥 ∈ (ℤ≥‘𝑥) → ¬ (ℤ≥‘𝑥) = ∅) | |
| 12 | 10, 11 | syl 18 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → ¬ (ℤ≥‘𝑥) = ∅) |
| 13 | 12 | nrex 3093 | . . . . 5 ⊢ ¬ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅ |
| 14 | fvelrnb 6931 | . . . . . 6 ⊢ (ℤ≥ Fn ℤ → (∅ ∈ ran ℤ≥ ↔ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅)) | |
| 15 | 5, 14 | ax-mp 5 | . . . . 5 ⊢ (∅ ∈ ran ℤ≥ ↔ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅) |
| 16 | 13, 15 | mtbir 326 | . . . 4 ⊢ ¬ ∅ ∈ ran ℤ≥ |
| 17 | 16 | nelir 3067 | . . 3 ⊢ ∅ ∉ ran ℤ≥ |
| 18 | uzin2 15386 | . . . . 5 ⊢ ((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) → (𝑥 ∩ 𝑦) ∈ ran ℤ≥) | |
| 19 | vex 3461 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 20 | 19 | inex1 5278 | . . . . . 6 ⊢ (𝑥 ∩ 𝑦) ∈ V |
| 21 | 20 | pwid 4581 | . . . . 5 ⊢ (𝑥 ∩ 𝑦) ∈ 𝒫 (𝑥 ∩ 𝑦) |
| 22 | inelcm 4422 | . . . . 5 ⊢ (((𝑥 ∩ 𝑦) ∈ ran ℤ≥ ∧ (𝑥 ∩ 𝑦) ∈ 𝒫 (𝑥 ∩ 𝑦)) → (ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅) | |
| 23 | 18, 21, 22 | sylancl 597 | . . . 4 ⊢ ((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) → (ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅) |
| 24 | 23 | rgen2 3205 | . . 3 ⊢ ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅ |
| 25 | 9, 17, 24 | 3pm3.2i 1356 | . 2 ⊢ (ran ℤ≥ ≠ ∅ ∧ ∅ ∉ ran ℤ≥ ∧ ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅) |
| 26 | zex 12591 | . . 3 ⊢ ℤ ∈ V | |
| 27 | isfbas 23947 | . . 3 ⊢ (ℤ ∈ V → (ran ℤ≥ ∈ (fBas‘ℤ) ↔ (ran ℤ≥ ⊆ 𝒫 ℤ ∧ (ran ℤ≥ ≠ ∅ ∧ ∅ ∉ ran ℤ≥ ∧ ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)))) | |
| 28 | 26, 27 | ax-mp 5 | . 2 ⊢ (ran ℤ≥ ∈ (fBas‘ℤ) ↔ (ran ℤ≥ ⊆ 𝒫 ℤ ∧ (ran ℤ≥ ≠ ∅ ∧ ∅ ∉ ran ℤ≥ ∧ ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅))) |
| 29 | 3, 25, 28 | mpbir2an 723 | 1 ⊢ ran ℤ≥ ∈ (fBas‘ℤ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 ∉ wnel 3064 ∀wral 3079 ∃wrex 3089 Vcvv 3457 ∩ cin 3906 ⊆ wss 3907 ∅c0 4288 𝒫 cpw 4558 ran crn 5653 Fn wfn 6520 ⟶wf 6521 ‘cfv 6525 1c1 11089 ℤcz 12582 ℤ≥cuz 12853 fBascfbas 21470 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-i2m1 11156 ax-1ne0 11157 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-neg 11432 df-nn 12225 df-z 12583 df-uz 12854 df-fbas 21479 |
| This theorem is referenced by: uzfbas 24016 |
| Copyright terms: Public domain | W3C validator |