Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  uzub Structured version   Visualization version   GIF version

Theorem uzub 41698
Description: A set of reals, indexed by upper integers, is bound if and only if any upper part is bound. (Contributed by Glauco Siliprandi, 23-Oct-2021.)
Hypotheses
Ref Expression
uzub.1 𝑗𝜑
uzub.2 (𝜑𝑀 ∈ ℤ)
uzub.3 𝑍 = (ℤ𝑀)
uzub.12 ((𝜑𝑗𝑍) → 𝐵 ∈ ℝ)
Assertion
Ref Expression
uzub (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘𝑍𝑗 ∈ (ℤ𝑘)𝐵𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝐵𝑥))
Distinct variable groups:   𝐵,𝑘,𝑥   𝑗,𝑀   𝑗,𝑍,𝑘,𝑥
Allowed substitution hints:   𝜑(𝑥,𝑗,𝑘)   𝐵(𝑗)   𝑀(𝑥,𝑘)

Proof of Theorem uzub
Dummy variables 𝑖 𝑤 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6664 . . . . . . . 8 (𝑘 = 𝑖 → (ℤ𝑘) = (ℤ𝑖))
21raleqdv 3415 . . . . . . 7 (𝑘 = 𝑖 → (∀𝑗 ∈ (ℤ𝑘)𝐵𝑥 ↔ ∀𝑗 ∈ (ℤ𝑖)𝐵𝑥))
32cbvrexvw 3450 . . . . . 6 (∃𝑘𝑍𝑗 ∈ (ℤ𝑘)𝐵𝑥 ↔ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑥)
43a1i 11 . . . . 5 (𝑥 = 𝑤 → (∃𝑘𝑍𝑗 ∈ (ℤ𝑘)𝐵𝑥 ↔ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑥))
5 breq2 5062 . . . . . . 7 (𝑥 = 𝑤 → (𝐵𝑥𝐵𝑤))
65ralbidv 3197 . . . . . 6 (𝑥 = 𝑤 → (∀𝑗 ∈ (ℤ𝑖)𝐵𝑥 ↔ ∀𝑗 ∈ (ℤ𝑖)𝐵𝑤))
76rexbidv 3297 . . . . 5 (𝑥 = 𝑤 → (∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑥 ↔ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤))
84, 7bitrd 281 . . . 4 (𝑥 = 𝑤 → (∃𝑘𝑍𝑗 ∈ (ℤ𝑘)𝐵𝑥 ↔ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤))
98cbvrexvw 3450 . . 3 (∃𝑥 ∈ ℝ ∃𝑘𝑍𝑗 ∈ (ℤ𝑘)𝐵𝑥 ↔ ∃𝑤 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤)
109a1i 11 . 2 (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘𝑍𝑗 ∈ (ℤ𝑘)𝐵𝑥 ↔ ∃𝑤 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤))
11 breq2 5062 . . . . . . . . 9 (𝑤 = 𝑦 → (𝐵𝑤𝐵𝑦))
1211ralbidv 3197 . . . . . . . 8 (𝑤 = 𝑦 → (∀𝑗 ∈ (ℤ𝑖)𝐵𝑤 ↔ ∀𝑗 ∈ (ℤ𝑖)𝐵𝑦))
1312rexbidv 3297 . . . . . . 7 (𝑤 = 𝑦 → (∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤 ↔ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑦))
1413cbvrexvw 3450 . . . . . 6 (∃𝑤 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤 ↔ ∃𝑦 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑦)
1514biimpi 218 . . . . 5 (∃𝑤 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤 → ∃𝑦 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑦)
16 uzub.1 . . . . . . . . . . . . 13 𝑗𝜑
17 nfv 1911 . . . . . . . . . . . . 13 𝑗 𝑦 ∈ ℝ
1816, 17nfan 1896 . . . . . . . . . . . 12 𝑗(𝜑𝑦 ∈ ℝ)
19 nfv 1911 . . . . . . . . . . . 12 𝑗 𝑖𝑍
2018, 19nfan 1896 . . . . . . . . . . 11 𝑗((𝜑𝑦 ∈ ℝ) ∧ 𝑖𝑍)
21 nfra1 3219 . . . . . . . . . . 11 𝑗𝑗 ∈ (ℤ𝑖)𝐵𝑦
2220, 21nfan 1896 . . . . . . . . . 10 𝑗(((𝜑𝑦 ∈ ℝ) ∧ 𝑖𝑍) ∧ ∀𝑗 ∈ (ℤ𝑖)𝐵𝑦)
23 nfmpt1 5156 . . . . . . . . . . . . . 14 𝑗(𝑗 ∈ (𝑀...𝑖) ↦ 𝐵)
2423nfrn 5818 . . . . . . . . . . . . 13 𝑗ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵)
25 nfcv 2977 . . . . . . . . . . . . 13 𝑗
26 nfcv 2977 . . . . . . . . . . . . 13 𝑗 <
2724, 25, 26nfsup 8909 . . . . . . . . . . . 12 𝑗sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )
28 nfcv 2977 . . . . . . . . . . . 12 𝑗
29 nfcv 2977 . . . . . . . . . . . 12 𝑗𝑦
3027, 28, 29nfbr 5105 . . . . . . . . . . 11 𝑗sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦
3130, 29, 27nfif 4495 . . . . . . . . . 10 𝑗if(sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦, 𝑦, sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ))
32 uzub.2 . . . . . . . . . . 11 (𝜑𝑀 ∈ ℤ)
3332ad3antrrr 728 . . . . . . . . . 10 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑖𝑍) ∧ ∀𝑗 ∈ (ℤ𝑖)𝐵𝑦) → 𝑀 ∈ ℤ)
34 uzub.3 . . . . . . . . . 10 𝑍 = (ℤ𝑀)
35 simpllr 774 . . . . . . . . . 10 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑖𝑍) ∧ ∀𝑗 ∈ (ℤ𝑖)𝐵𝑦) → 𝑦 ∈ ℝ)
36 eqid 2821 . . . . . . . . . 10 sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) = sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )
37 eqid 2821 . . . . . . . . . 10 if(sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦, 𝑦, sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )) = if(sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦, 𝑦, sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ))
38 simplr 767 . . . . . . . . . 10 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑖𝑍) ∧ ∀𝑗 ∈ (ℤ𝑖)𝐵𝑦) → 𝑖𝑍)
39 uzub.12 . . . . . . . . . . 11 ((𝜑𝑗𝑍) → 𝐵 ∈ ℝ)
4039ad5ant15 757 . . . . . . . . . 10 (((((𝜑𝑦 ∈ ℝ) ∧ 𝑖𝑍) ∧ ∀𝑗 ∈ (ℤ𝑖)𝐵𝑦) ∧ 𝑗𝑍) → 𝐵 ∈ ℝ)
41 simpr 487 . . . . . . . . . 10 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑖𝑍) ∧ ∀𝑗 ∈ (ℤ𝑖)𝐵𝑦) → ∀𝑗 ∈ (ℤ𝑖)𝐵𝑦)
4222, 31, 33, 34, 35, 36, 37, 38, 40, 41uzublem 41697 . . . . . . . . 9 ((((𝜑𝑦 ∈ ℝ) ∧ 𝑖𝑍) ∧ ∀𝑗 ∈ (ℤ𝑖)𝐵𝑦) → ∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤)
4342rexlimdva2 3287 . . . . . . . 8 ((𝜑𝑦 ∈ ℝ) → (∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑦 → ∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤))
4443imp 409 . . . . . . 7 (((𝜑𝑦 ∈ ℝ) ∧ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑦) → ∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤)
4544rexlimdva2 3287 . . . . . 6 (𝜑 → (∃𝑦 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑦 → ∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤))
4645imp 409 . . . . 5 ((𝜑 ∧ ∃𝑦 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑦) → ∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤)
4715, 46sylan2 594 . . . 4 ((𝜑 ∧ ∃𝑤 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤) → ∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤)
4847ex 415 . . 3 (𝜑 → (∃𝑤 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤 → ∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤))
4932, 34uzidd2 41683 . . . . . . 7 (𝜑𝑀𝑍)
5049ad2antrr 724 . . . . . 6 (((𝜑𝑤 ∈ ℝ) ∧ ∀𝑗𝑍 𝐵𝑤) → 𝑀𝑍)
5134raleqi 3413 . . . . . . . 8 (∀𝑗𝑍 𝐵𝑤 ↔ ∀𝑗 ∈ (ℤ𝑀)𝐵𝑤)
5251biimpi 218 . . . . . . 7 (∀𝑗𝑍 𝐵𝑤 → ∀𝑗 ∈ (ℤ𝑀)𝐵𝑤)
5352adantl 484 . . . . . 6 (((𝜑𝑤 ∈ ℝ) ∧ ∀𝑗𝑍 𝐵𝑤) → ∀𝑗 ∈ (ℤ𝑀)𝐵𝑤)
54 nfv 1911 . . . . . . 7 𝑖𝑗 ∈ (ℤ𝑀)𝐵𝑤
55 fveq2 6664 . . . . . . . 8 (𝑖 = 𝑀 → (ℤ𝑖) = (ℤ𝑀))
5655raleqdv 3415 . . . . . . 7 (𝑖 = 𝑀 → (∀𝑗 ∈ (ℤ𝑖)𝐵𝑤 ↔ ∀𝑗 ∈ (ℤ𝑀)𝐵𝑤))
5754, 56rspce 3611 . . . . . 6 ((𝑀𝑍 ∧ ∀𝑗 ∈ (ℤ𝑀)𝐵𝑤) → ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤)
5850, 53, 57syl2anc 586 . . . . 5 (((𝜑𝑤 ∈ ℝ) ∧ ∀𝑗𝑍 𝐵𝑤) → ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤)
5958ex 415 . . . 4 ((𝜑𝑤 ∈ ℝ) → (∀𝑗𝑍 𝐵𝑤 → ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤))
6059reximdva 3274 . . 3 (𝜑 → (∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤 → ∃𝑤 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤))
6148, 60impbid 214 . 2 (𝜑 → (∃𝑤 ∈ ℝ ∃𝑖𝑍𝑗 ∈ (ℤ𝑖)𝐵𝑤 ↔ ∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤))
62 breq2 5062 . . . . 5 (𝑤 = 𝑥 → (𝐵𝑤𝐵𝑥))
6362ralbidv 3197 . . . 4 (𝑤 = 𝑥 → (∀𝑗𝑍 𝐵𝑤 ↔ ∀𝑗𝑍 𝐵𝑥))
6463cbvrexvw 3450 . . 3 (∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤 ↔ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝐵𝑥)
6564a1i 11 . 2 (𝜑 → (∃𝑤 ∈ ℝ ∀𝑗𝑍 𝐵𝑤 ↔ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝐵𝑥))
6610, 61, 653bitrd 307 1 (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘𝑍𝑗 ∈ (ℤ𝑘)𝐵𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝐵𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1533  wnf 1780  wcel 2110  wral 3138  wrex 3139  ifcif 4466   class class class wbr 5058  cmpt 5138  ran crn 5550  cfv 6349  (class class class)co 7150  supcsup 8898  cr 10530   < clt 10669  cle 10670  cz 11975  cuz 12237  ...cfz 12886
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 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608  ax-pre-sup 10609
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-int 4869  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7575  df-1st 7683  df-2nd 7684  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-1o 8096  df-oadd 8100  df-er 8283  df-en 8504  df-dom 8505  df-sdom 8506  df-fin 8507  df-sup 8900  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-nn 11633  df-n0 11892  df-z 11976  df-uz 12238  df-fz 12887  df-fzo 13028
This theorem is referenced by:  limsupreuz  42011
  Copyright terms: Public domain W3C validator