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 22956 | . 2 ⊢ (𝑀 ∈ ℤ → (ran ℤ≥ ↾t 𝑍) = (ℤ≥ “ 𝑍)) |
3 | zfbas 22955 | . . . . 5 ⊢ ran ℤ≥ ∈ (fBas‘ℤ) | |
4 | 0nelfb 22890 | . . . . 5 ⊢ (ran ℤ≥ ∈ (fBas‘ℤ) → ¬ ∅ ∈ ran ℤ≥) | |
5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ ¬ ∅ ∈ ran ℤ≥ |
6 | imassrn 5969 | . . . . . 6 ⊢ (ℤ≥ “ 𝑍) ⊆ ran ℤ≥ | |
7 | 2, 6 | eqsstrdi 3971 | . . . . 5 ⊢ (𝑀 ∈ ℤ → (ran ℤ≥ ↾t 𝑍) ⊆ ran ℤ≥) |
8 | 7 | sseld 3916 | . . . 4 ⊢ (𝑀 ∈ ℤ → (∅ ∈ (ran ℤ≥ ↾t 𝑍) → ∅ ∈ ran ℤ≥)) |
9 | 5, 8 | mtoi 198 | . . 3 ⊢ (𝑀 ∈ ℤ → ¬ ∅ ∈ (ran ℤ≥ ↾t 𝑍)) |
10 | uzssz 12532 | . . . . 5 ⊢ (ℤ≥‘𝑀) ⊆ ℤ | |
11 | 1, 10 | eqsstri 3951 | . . . 4 ⊢ 𝑍 ⊆ ℤ |
12 | trfbas2 22902 | . . . 4 ⊢ ((ran ℤ≥ ∈ (fBas‘ℤ) ∧ 𝑍 ⊆ ℤ) → ((ran ℤ≥ ↾t 𝑍) ∈ (fBas‘𝑍) ↔ ¬ ∅ ∈ (ran ℤ≥ ↾t 𝑍))) | |
13 | 3, 11, 12 | mp2an 688 | . . 3 ⊢ ((ran ℤ≥ ↾t 𝑍) ∈ (fBas‘𝑍) ↔ ¬ ∅ ∈ (ran ℤ≥ ↾t 𝑍)) |
14 | 9, 13 | sylibr 233 | . 2 ⊢ (𝑀 ∈ ℤ → (ran ℤ≥ ↾t 𝑍) ∈ (fBas‘𝑍)) |
15 | 2, 14 | eqeltrrd 2840 | 1 ⊢ (𝑀 ∈ ℤ → (ℤ≥ “ 𝑍) ∈ (fBas‘𝑍)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1539 ∈ wcel 2108 ⊆ wss 3883 ∅c0 4253 ran crn 5581 “ cima 5583 ‘cfv 6418 (class class class)co 7255 ℤcz 12249 ℤ≥cuz 12511 ↾t crest 17048 fBascfbas 20498 |
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-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-i2m1 10870 ax-1ne0 10871 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 |
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-iun 4923 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-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 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-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-neg 11138 df-nn 11904 df-z 12250 df-uz 12512 df-rest 17050 df-fbas 20507 |
This theorem is referenced by: lmflf 23064 caucfil 24352 cmetcaulem 24357 |
Copyright terms: Public domain | W3C validator |