Theorem uzub 46072

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.

Step	Hyp	Ref	Expression
1		fveq2 6882	. . . . . . . 8 ⊢ (𝑘 = 𝑖 → (ℤ≥‘𝑘) = (ℤ≥‘𝑖))
2	1	raleqdv 3329	. . . . . . 7 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥))
3	2	cbvrexvw 3250	. . . . . 6 ⊢ (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥)
4	3	a1i 11	. . . . 5 ⊢ (𝑥 = 𝑤 → (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥))
5		breq2 5115	. . . . . . 7 ⊢ (𝑥 = 𝑤 → (𝐵 ≤ 𝑥 ↔ 𝐵 ≤ 𝑤))
6	5	ralbidv 3194	. . . . . 6 ⊢ (𝑥 = 𝑤 → (∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
7	6	rexbidv 3195	. . . . 5 ⊢ (𝑥 = 𝑤 → (∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
8	4, 7	bitrd 282	. . . 4 ⊢ (𝑥 = 𝑤 → (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
9	8	cbvrexvw 3250	. . 3 ⊢ (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤)
10	9	a1i 11	. 2 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
11		breq2 5115	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → (𝐵 ≤ 𝑤 ↔ 𝐵 ≤ 𝑦))
12	11	ralbidv 3194	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → (∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦))
13	12	rexbidv 3195	. . . . . . 7 ⊢ (𝑤 = 𝑦 → (∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦))
14	13	cbvrexvw 3250	. . . . . 6 ⊢ (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
15	14	biimpi 219	. . . . 5 ⊢ (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 → ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
16		uzub.1	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗𝜑
17		nfv 1941	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗 𝑦 ∈ ℝ
18	16, 17	nfan 1926	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑦 ∈ ℝ)
19		nfv 1941	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 𝑖 ∈ 𝑍
20	18, 19	nfan 1926	. . . . . . . . . . 11 ⊢ Ⅎ𝑗((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍)
21		nfra1 3295	. . . . . . . . . . 11 ⊢ Ⅎ𝑗∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦
22	20, 21	nfan 1926	. . . . . . . . . 10 ⊢ Ⅎ𝑗(((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
23		nfmpt1 5212	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗(𝑗 ∈ (𝑀...𝑖) ↦ 𝐵)
24	23	nfrn 5943	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵)
25		nfcv 2931	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗ℝ
26		nfcv 2931	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗 <
27	24, 25, 26	nfsup 9411	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )
28		nfcv 2931	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 ≤
29		nfcv 2931	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗𝑦
30	27, 28, 29	nfbr 5160	. . . . . . . . . . 11 ⊢ Ⅎ𝑗sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦
31	30, 29, 27	nfif 4521	. . . . . . . . . 10 ⊢ Ⅎ𝑗if(sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦, 𝑦, sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ))
32		uzub.2	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℤ)
33	32	ad3antrrr 742	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → 𝑀 ∈ ℤ)
34		uzub.3	. . . . . . . . . 10 ⊢ 𝑍 = (ℤ≥‘𝑀)
35		simpllr 787	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → 𝑦 ∈ ℝ)
36		eqid 2769	. . . . . . . . . 10 ⊢ sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) = sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )
37		eqid 2769	. . . . . . . . . 10 ⊢ if(sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦, 𝑦, sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )) = if(sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦, 𝑦, sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ))
38		simplr 780	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → 𝑖 ∈ 𝑍)
39		uzub.12	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝐵 ∈ ℝ)
40	39	ad5ant15 770	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) ∧ 𝑗 ∈ 𝑍) → 𝐵 ∈ ℝ)
41		simpr 489	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
42	22, 31, 33, 34, 35, 36, 37, 38, 40, 41	uzublem 46071	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
43	42	rexlimdva2 3174	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦 → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
44	43	imp 411	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
45	44	rexlimdva2 3174	. . . . . 6 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦 → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
46	45	imp 411	. . . . 5 ⊢ ((𝜑 ∧ ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
47	15, 46	sylan2 604	. . . 4 ⊢ ((𝜑 ∧ ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
48	47	ex 417	. . 3 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
49	32, 34	uzidd2 46057	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ 𝑍)
50	49	ad2antrr 738	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤) → 𝑀 ∈ 𝑍)
51	34	raleqi 3327	. . . . . . 7 ⊢ (∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤)
52	51	bilani 509	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤) → ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤)
53		nfv 1941	. . . . . . 7 ⊢ Ⅎ𝑖∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤
54		fveq2 6882	. . . . . . . 8 ⊢ (𝑖 = 𝑀 → (ℤ≥‘𝑖) = (ℤ≥‘𝑀))
55	54	raleqdv 3329	. . . . . . 7 ⊢ (𝑖 = 𝑀 → (∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤))
56	53, 55	rspce 3577	. . . . . 6 ⊢ ((𝑀 ∈ 𝑍 ∧ ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤) → ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤)
57	50, 52, 56	syl2anc 595	. . . . 5 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤) → ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤)
58	57	ex 417	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 → ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
59	58	reximdva 3184	. . 3 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 → ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
60	48, 59	impbid 215	. 2 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
61		breq2 5115	. . . . 5 ⊢ (𝑤 = 𝑥 → (𝐵 ≤ 𝑤 ↔ 𝐵 ≤ 𝑥))
62	61	ralbidv 3194	. . . 4 ⊢ (𝑤 = 𝑥 → (∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑥))
63	62	cbvrexvw 3250	. . 3 ⊢ (∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑥)
64	63	a1i 11	. 2 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑥))
65	10, 60, 64	3bitrd 308	1 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑥))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1567  Ⅎwnf 1810   ∈ wcel 2149  ∀wral 3085  ∃wrex 3095  ifcif 4490   class class class wbr 5111   ↦ cmpt 5194  ran crn 5663  ‘cfv 6537  (class class class)co 7411  supcsup 9400  ℝcr 11099   < clt 11243   ≤ cle 11244  ℤcz 12591  ℤ_≥cuz 12862  ...cfz 13535

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5259  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177  ax-pre-sup 11178

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3375  df-reu 3376  df-rab 3423  df-v 3463  df-sbc 3752  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-er 8694  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-sup 9402  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-nn 12234  df-n0 12505  df-z 12592  df-uz 12863  df-fz 13536  df-fzo 13683

This theorem is referenced by:  limsupreuz  46378