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

Theorem zfbas 24245
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 12995 . . 3 ℤ≥:ℤ⟶𝒫 ℤ
2 frn 6739 . . 3 (ℤ≥:ℤ⟶𝒫 ℤ → ran ℤ≥ ⊆ 𝒫 ℤ)
31, 2ax-mp 5 . 2 ran ℤ≥ ⊆ 𝒫 ℤ
4 ffn 6731 . . . . . 6 (ℤ≥:ℤ⟶𝒫 ℤ → ℤ≥ Fn ℤ)
51, 4ax-mp 5 . . . . 5 ℤ≥ Fn ℤ
6 1z 12753 . . . . 5 1 ∈ ℤ
7 fnfvelrn 7104 . . . . 5 ((ℤ≥ Fn ℤ ∧ 1 ∈ ℤ) → (ℤ≥‘1) ∈ ran ℤ≥)
85, 6, 7mp2an 705 . . . 4 (ℤ≥‘1) ∈ ran ℤ≥
98ne0ii 4293 . . 3 ran ℤ≥ ≠ ∅
10 uzid 13007 . . . . . . 7 (𝑥 ∈ ℤ → 𝑥 ∈ (ℤ≥‘𝑥))
11 n0i 4289 . . . . . . 7 (𝑥 ∈ (ℤ≥‘𝑥) → ¬ (ℤ≥‘𝑥) = ∅)
1210, 11syl 18 . . . . . 6 (𝑥 ∈ ℤ → ¬ (ℤ≥‘𝑥) = ∅)
1312nrex 3094 . . . . 5 ¬ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅
14 fvelrnb 6968 . . . . . 6 (ℤ≥ Fn ℤ → (∅ ∈ ran ℤ≥ ↔ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅))
155, 14ax-mp 5 . . . . 5 (∅ ∈ ran ℤ≥ ↔ ∃𝑥 ∈ ℤ (ℤ≥‘𝑥) = ∅)
1613, 15mtbir 326 . . . 4 ¬ ∅ ∈ ran ℤ≥
1716nelir 3068 . . 3 ∅ ∉ ran ℤ≥
18 uzin2 15541 . . . . 5 ((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) → (𝑥 ∩ 𝑦) ∈ ran ℤ≥)
19 vex 3458 . . . . . . 7 𝑥 ∈ V
2019inex1 5281 . . . . . 6 (𝑥 ∩ 𝑦) ∈ V
2120pwid 4584 . . . . 5 (𝑥 ∩ 𝑦) ∈ 𝒫 (𝑥 ∩ 𝑦)
22 inelcm 4421 . . . . 5 (((𝑥 ∩ 𝑦) ∈ ran ℤ≥ ∧ (𝑥 ∩ 𝑦) ∈ 𝒫 (𝑥 ∩ 𝑦)) → (ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)
2318, 21, 22sylancl 598 . . . 4 ((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) → (ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)
2423rgen2 3206 . . 3 ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅
259, 17, 243pm3.2i 1358 . 2 (ran ℤ≥ ≠ ∅ ∧ ∅ ∉ ran ℤ≥ ∧ ∀𝑥 ∈ ran ℤ≥∀𝑦 ∈ ran ℤ≥(ran ℤ≥ ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)
26 zex 12729 . . 3 ℤ ∈ V
27 isfbas 24178 . . 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 2147   ≠ wne 2959   ∉ wnel 3065  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  𝒫 cpw 4560  ran crn 5656   Fn wfn 6553  ⟶wf 6554  ‘cfv 6558  1c1 11228  ℤcz 12720  ℤ≥cuz 12992  fBascfbas 21696
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-addrcl 11288  ax-mulcl 11289  ax-mulrcl 11290  ax-i2m1 11295  ax-1ne0 11296  ax-rrecex 11299  ax-cnre 11300  ax-pre-lttri 11301  ax-pre-lttrn 11302
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-om 7902  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-er 8745  df-en 9002  df-dom 9003  df-sdom 9004  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-neg 11571  df-nn 12363  df-z 12721  df-uz 12993  df-fbas 21705
This theorem is used by:  uzfbas  24247
  Copyright terms: Public domain W3C validator