Theorem uzub 46246

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 3321	. . . . . . 7 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥))
3	2	cbvrexvw 3243	. . . . . 6 ⊢ (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥)
4	3	a1i 11	. . . . 5 ⊢ (𝑥 = 𝑤 → (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥))
5		breq2 5111	. . . . . . 7 ⊢ (𝑥 = 𝑤 → (𝐵 ≤ 𝑥 ↔ 𝐵 ≤ 𝑤))
6	5	ralbidv 3187	. . . . . 6 ⊢ (𝑥 = 𝑤 → (∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
7	6	rexbidv 3188	. . . . 5 ⊢ (𝑥 = 𝑤 → (∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
8	4, 7	bitrd 282	. . . 4 ⊢ (𝑥 = 𝑤 → (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
9	8	cbvrexvw 3243	. . 3 ⊢ (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤)
10	9	a1i 11	. 2 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
11		breq2 5111	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → (𝐵 ≤ 𝑤 ↔ 𝐵 ≤ 𝑦))
12	11	ralbidv 3187	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → (∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦))
13	12	rexbidv 3188	. . . . . . 7 ⊢ (𝑤 = 𝑦 → (∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦))
14	13	cbvrexvw 3243	. . . . . 6 ⊢ (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
15	14	biimpi 219	. . . . 5 ⊢ (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 → ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
16		uzub.1	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗𝜑
17		nfv 1947	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗 𝑦 ∈ ℝ
18	16, 17	nfan 1932	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑦 ∈ ℝ)
19		nfv 1947	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 𝑖 ∈ 𝑍
20	18, 19	nfan 1932	. . . . . . . . . . 11 ⊢ Ⅎ𝑗((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍)
21		nfra1 3288	. . . . . . . . . . 11 ⊢ Ⅎ𝑗∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦
22	20, 21	nfan 1932	. . . . . . . . . 10 ⊢ Ⅎ𝑗(((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
23		nfmpt1 5208	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗(𝑗 ∈ (𝑀...𝑖) ↦ 𝐵)
24	23	nfrn 5940	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵)
25		nfcv 2924	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗ℝ
26		nfcv 2924	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗 <
27	24, 25, 26	nfsup 9424	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )
28		nfcv 2924	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 ≤
29		nfcv 2924	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗𝑦
30	27, 28, 29	nfbr 5156	. . . . . . . . . . 11 ⊢ Ⅎ𝑗sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦
31	30, 29, 27	nfif 4516	. . . . . . . . . 10 ⊢ Ⅎ𝑗if(sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦, 𝑦, sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ))
32		uzub.2	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℤ)
33	32	ad3antrrr 743	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → 𝑀 ∈ ℤ)
34		uzub.3	. . . . . . . . . 10 ⊢ 𝑍 = (ℤ≥‘𝑀)
35		simpllr 788	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → 𝑦 ∈ ℝ)
36		eqid 2762	. . . . . . . . . 10 ⊢ sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) = sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )
37		eqid 2762	. . . . . . . . . 10 ⊢ if(sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦, 𝑦, sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )) = if(sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) ≤ 𝑦, 𝑦, sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ))
38		simplr 781	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → 𝑖 ∈ 𝑍)
39		uzub.12	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝐵 ∈ ℝ)
40	39	ad5ant15 771	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) ∧ 𝑗 ∈ 𝑍) → 𝐵 ∈ ℝ)
41		simpr 490	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
42	22, 31, 33, 34, 35, 36, 37, 38, 40, 41	uzublem 46245	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
43	42	rexlimdva2 3167	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦 → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
44	43	imp 412	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
45	44	rexlimdva2 3167	. . . . . 6 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦 → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
46	45	imp 412	. . . . 5 ⊢ ((𝜑 ∧ ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
47	15, 46	sylan2 605	. . . 4 ⊢ ((𝜑 ∧ ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
48	47	ex 418	. . 3 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
49	32, 34	uzidd2 46231	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ 𝑍)
50	49	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤) → 𝑀 ∈ 𝑍)
51	34	raleqi 3319	. . . . . . 7 ⊢ (∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤)
52	51	bilani 510	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤) → ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤)
53		nfv 1947	. . . . . . 7 ⊢ Ⅎ𝑖∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤
54		fveq2 6882	. . . . . . . 8 ⊢ (𝑖 = 𝑀 → (ℤ≥‘𝑖) = (ℤ≥‘𝑀))
55	54	raleqdv 3321	. . . . . . 7 ⊢ (𝑖 = 𝑀 → (∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤))
56	53, 55	rspce 3568	. . . . . 6 ⊢ ((𝑀 ∈ 𝑍 ∧ ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤) → ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤)
57	50, 52, 56	syl2anc 596	. . . . 5 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤) → ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤)
58	57	ex 418	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 → ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
59	58	reximdva 3177	. . 3 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 → ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
60	48, 59	impbid 215	. 2 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
61		breq2 5111	. . . . 5 ⊢ (𝑤 = 𝑥 → (𝐵 ≤ 𝑤 ↔ 𝐵 ≤ 𝑥))
62	61	ralbidv 3187	. . . 4 ⊢ (𝑤 = 𝑥 → (∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑥))
63	62	cbvrexvw 3243	. . 3 ⊢ (∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑥)
64	63	a1i 11	. 2 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑥))
65	10, 60, 64	3bitrd 308	1 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑥))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088  ifcif 4485   class class class wbr 5107   ↦ cmpt 5190  ran crn 5660  ‘cfv 6537  (class class class)co 7416  supcsup 9413  ℝcr 11126   < clt 11270   ≤ cle 11271  ℤcz 12618  ℤ_≥cuz 12890  ...cfz 13563

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204  ax-pre-sup 11205

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-sup 9415  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-nn 12261  df-n0 12532  df-z 12619  df-uz 12891  df-fz 13564  df-fzo 13712

This theorem is used by:  limsupreuz  46552