MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  zfbas Structured version   Visualization version   GIF version

Theorem zfbas 24195
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.)
Assertion
Ref Expression
zfbas ran ℤ≥ ∈ (fBas‘ℤ)

Proof of Theorem zfbas
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uzf 12949 . . 3 ℤ≥:ℤ⟶𝒫 ℤ
2 frn 6709 . . 3 (ℤ≥:ℤ⟶𝒫 ℤ → ran ℤ≥ ⊆ 𝒫 ℤ)
31, 2ax-mp 5 . 2 ran ℤ≥ ⊆ 𝒫 ℤ
4 ffn 6701 . . . . . 6 (ℤ≥:ℤ⟶𝒫 ℤ → ℤ≥ Fn ℤ)
51, 4ax-mp 5 . . . . 5 ℤ≥ Fn ℤ
6 1z 12707 . . . . 5 1 ∈ ℤ
7 fnfvelrn 7072 . . . . 5 ((ℤ≥ Fn ℤ ∧ 1 ∈ ℤ) → (ℤ≥‘1) ∈ ran ℤ≥)
85, 6, 7mp2an 705 . . . 4 (ℤ≥‘1) ∈ ran ℤ≥
98ne0ii 4290 . . 3 ran ℤ≥ ≠ ∅
10 uzid 12961 . . . . . . 7 (𝑥 ∈ ℤ → 𝑥 ∈ (ℤ≥‘𝑥))
11 n0i 4286 . . . . . . 7 (𝑥 ∈ (ℤ≥‘𝑥) → ¬ (ℤ≥‘𝑥) = ∅)
1210, 11syl 18 . . . . . 6 (𝑥 ∈ ℤ → ¬ (ℤ≥‘𝑥) = ∅)
1312nrex 3091 . . . . 5 ¬ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅
14 fvelrnb 6937 . . . . . 6 (ℤ≥ Fn ℤ → (∅ ∈ ran ℤ≥ ↔ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅))
155, 14ax-mp 5 . . . . 5 (∅ ∈ ran ℤ≥ ↔ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅)
1613, 15mtbir 326 . . . 4 ¬ ∅ ∈ ran ℤ≥
1716nelir 3065 . . 3 ∅ ∉ ran ℤ≥
18 uzin2 15492 . . . . 5 ((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) → (𝑥 ∩ 𝑦) ∈ ran ℤ≥)
19 vex 3455 . . . . . . 7 𝑥 ∈ V
2019inex1 5277 . . . . . 6 (𝑥 ∩ 𝑦) ∈ V
2120pwid 4580 . . . . 5 (𝑥 ∩ 𝑦) ∈ 𝒫 (𝑥 ∩ 𝑦)
22 inelcm 4418 . . . . 5 (((𝑥 ∩ 𝑦) ∈ ran ℤ≥ ∧ (𝑥 ∩ 𝑦) ∈ 𝒫 (𝑥 ∩ 𝑦)) → (ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)
2318, 21, 22sylancl 598 . . . 4 ((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) → (ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)
2423rgen2 3203 . . 3 ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅
259, 17, 243pm3.2i 1358 . 2 (ran ℤ≥ ≠ ∅ ∧ ∅ ∉ ran ℤ≥ ∧ ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)
26 zex 12683 . . 3 ℤ ∈ V
27 isfbas 24128 . . 3 (ℤ ∈ V → (ran ℤ≥ ∈ (fBas‘ℤ) ↔ (ran ℤ≥ ⊆ 𝒫 ℤ ∧ (ran ℤ≥ ≠ ∅ ∧ ∅ ∉ ran ℤ≥ ∧ ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅))))
2826, 27ax-mp 5 . 2 (ran ℤ≥ ∈ (fBas‘ℤ) ↔ (ran ℤ≥ ⊆ 𝒫 ℤ ∧ (ran ℤ≥ ≠ ∅ ∧ ∅ ∉ ran ℤ≥ ∧ ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)))
293, 25, 28mpbir2an 724 1 ran ℤ≥ ∈ (fBas‘ℤ)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956   ∉ wnel 3062  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ran crn 5652   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531  1c1 11182  ℤcz 12674  ℤ≥cuz 12946  fBascfbas 21646
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-resscn 11238  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-addrcl 11242  ax-mulcl 11243  ax-mulrcl 11244  ax-i2m1 11249  ax-1ne0 11250  ax-rrecex 11253  ax-cnre 11254  ax-pre-lttri 11255  ax-pre-lttrn 11256
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-er 8701  df-en 8958  df-dom 8959  df-sdom 8960  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-neg 11525  df-nn 12317  df-z 12675  df-uz 12947  df-fbas 21655
This theorem is used by:  uzfbas  24197
  Copyright terms: Public domain W3C validator