![]() |
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 12879 | . . 3 ⊢ ℤ≥:ℤ⟶𝒫 ℤ | |
2 | frn 6744 | . . 3 ⊢ (ℤ≥:ℤ⟶𝒫 ℤ → ran ℤ≥ ⊆ 𝒫 ℤ) | |
3 | 1, 2 | ax-mp 5 | . 2 ⊢ ran ℤ≥ ⊆ 𝒫 ℤ |
4 | ffn 6737 | . . . . . 6 ⊢ (ℤ≥:ℤ⟶𝒫 ℤ → ℤ≥ Fn ℤ) | |
5 | 1, 4 | ax-mp 5 | . . . . 5 ⊢ ℤ≥ Fn ℤ |
6 | 1z 12645 | . . . . 5 ⊢ 1 ∈ ℤ | |
7 | fnfvelrn 7100 | . . . . 5 ⊢ ((ℤ≥ Fn ℤ ∧ 1 ∈ ℤ) → (ℤ≥‘1) ∈ ran ℤ≥) | |
8 | 5, 6, 7 | mp2an 692 | . . . 4 ⊢ (ℤ≥‘1) ∈ ran ℤ≥ |
9 | 8 | ne0ii 4350 | . . 3 ⊢ ran ℤ≥ ≠ ∅ |
10 | uzid 12891 | . . . . . . 7 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ (ℤ≥‘𝑥)) | |
11 | n0i 4346 | . . . . . . 7 ⊢ (𝑥 ∈ (ℤ≥‘𝑥) → ¬ (ℤ≥‘𝑥) = ∅) | |
12 | 10, 11 | syl 17 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → ¬ (ℤ≥‘𝑥) = ∅) |
13 | 12 | nrex 3072 | . . . . 5 ⊢ ¬ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅ |
14 | fvelrnb 6969 | . . . . . 6 ⊢ (ℤ≥ Fn ℤ → (∅ ∈ ran ℤ≥ ↔ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅)) | |
15 | 5, 14 | ax-mp 5 | . . . . 5 ⊢ (∅ ∈ ran ℤ≥ ↔ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅) |
16 | 13, 15 | mtbir 323 | . . . 4 ⊢ ¬ ∅ ∈ ran ℤ≥ |
17 | 16 | nelir 3047 | . . 3 ⊢ ∅ ∉ ran ℤ≥ |
18 | uzin2 15380 | . . . . 5 ⊢ ((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) → (𝑥 ∩ 𝑦) ∈ ran ℤ≥) | |
19 | vex 3482 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
20 | 19 | inex1 5323 | . . . . . 6 ⊢ (𝑥 ∩ 𝑦) ∈ V |
21 | 20 | pwid 4627 | . . . . 5 ⊢ (𝑥 ∩ 𝑦) ∈ 𝒫 (𝑥 ∩ 𝑦) |
22 | inelcm 4471 | . . . . 5 ⊢ (((𝑥 ∩ 𝑦) ∈ ran ℤ≥ ∧ (𝑥 ∩ 𝑦) ∈ 𝒫 (𝑥 ∩ 𝑦)) → (ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅) | |
23 | 18, 21, 22 | sylancl 586 | . . . 4 ⊢ ((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) → (ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅) |
24 | 23 | rgen2 3197 | . . 3 ⊢ ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅ |
25 | 9, 17, 24 | 3pm3.2i 1338 | . 2 ⊢ (ran ℤ≥ ≠ ∅ ∧ ∅ ∉ ran ℤ≥ ∧ ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅) |
26 | zex 12620 | . . 3 ⊢ ℤ ∈ V | |
27 | isfbas 23853 | . . 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 711 | 1 ⊢ ran ℤ≥ ∈ (fBas‘ℤ) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 ∉ wnel 3044 ∀wral 3059 ∃wrex 3068 Vcvv 3478 ∩ cin 3962 ⊆ wss 3963 ∅c0 4339 𝒫 cpw 4605 ran crn 5690 Fn wfn 6558 ⟶wf 6559 ‘cfv 6563 1c1 11154 ℤcz 12611 ℤ≥cuz 12876 fBascfbas 21370 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-i2m1 11221 ax-1ne0 11222 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-ov 7434 df-om 7888 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-neg 11493 df-nn 12265 df-z 12612 df-uz 12877 df-fbas 21379 |
This theorem is referenced by: uzfbas 23922 |
Copyright terms: Public domain | W3C validator |