![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > uzfbas | Structured version Visualization version GIF version |
Description: The set of upper sets of integers based at a point in a fixed upper integer set like ℕ is a filter base on ℕ, which corresponds to convergence of sequences on ℕ. (Contributed by Mario Carneiro, 13-Oct-2015.) |
Ref | Expression |
---|---|
uzfbas.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
Ref | Expression |
---|---|
uzfbas | ⊢ (𝑀 ∈ ℤ → (ℤ≥ “ 𝑍) ∈ (fBas‘𝑍)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uzfbas.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
2 | 1 | uzrest 23400 | . 2 ⊢ (𝑀 ∈ ℤ → (ran ℤ≥ ↾t 𝑍) = (ℤ≥ “ 𝑍)) |
3 | zfbas 23399 | . . . . 5 ⊢ ran ℤ≥ ∈ (fBas‘ℤ) | |
4 | 0nelfb 23334 | . . . . 5 ⊢ (ran ℤ≥ ∈ (fBas‘ℤ) → ¬ ∅ ∈ ran ℤ≥) | |
5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ ¬ ∅ ∈ ran ℤ≥ |
6 | imassrn 6070 | . . . . . 6 ⊢ (ℤ≥ “ 𝑍) ⊆ ran ℤ≥ | |
7 | 2, 6 | eqsstrdi 4036 | . . . . 5 ⊢ (𝑀 ∈ ℤ → (ran ℤ≥ ↾t 𝑍) ⊆ ran ℤ≥) |
8 | 7 | sseld 3981 | . . . 4 ⊢ (𝑀 ∈ ℤ → (∅ ∈ (ran ℤ≥ ↾t 𝑍) → ∅ ∈ ran ℤ≥)) |
9 | 5, 8 | mtoi 198 | . . 3 ⊢ (𝑀 ∈ ℤ → ¬ ∅ ∈ (ran ℤ≥ ↾t 𝑍)) |
10 | uzssz 12842 | . . . . 5 ⊢ (ℤ≥‘𝑀) ⊆ ℤ | |
11 | 1, 10 | eqsstri 4016 | . . . 4 ⊢ 𝑍 ⊆ ℤ |
12 | trfbas2 23346 | . . . 4 ⊢ ((ran ℤ≥ ∈ (fBas‘ℤ) ∧ 𝑍 ⊆ ℤ) → ((ran ℤ≥ ↾t 𝑍) ∈ (fBas‘𝑍) ↔ ¬ ∅ ∈ (ran ℤ≥ ↾t 𝑍))) | |
13 | 3, 11, 12 | mp2an 690 | . . 3 ⊢ ((ran ℤ≥ ↾t 𝑍) ∈ (fBas‘𝑍) ↔ ¬ ∅ ∈ (ran ℤ≥ ↾t 𝑍)) |
14 | 9, 13 | sylibr 233 | . 2 ⊢ (𝑀 ∈ ℤ → (ran ℤ≥ ↾t 𝑍) ∈ (fBas‘𝑍)) |
15 | 2, 14 | eqeltrrd 2834 | 1 ⊢ (𝑀 ∈ ℤ → (ℤ≥ “ 𝑍) ∈ (fBas‘𝑍)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1541 ∈ wcel 2106 ⊆ wss 3948 ∅c0 4322 ran crn 5677 “ cima 5679 ‘cfv 6543 (class class class)co 7408 ℤcz 12557 ℤ≥cuz 12821 ↾t crest 17365 fBascfbas 20931 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-i2m1 11177 ax-1ne0 11178 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-neg 11446 df-nn 12212 df-z 12558 df-uz 12822 df-rest 17367 df-fbas 20940 |
This theorem is referenced by: lmflf 23508 caucfil 24799 cmetcaulem 24804 |
Copyright terms: Public domain | W3C validator |