Theorem uzub 46644

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 6905	. . . . . . . 8 ⊢ (𝑘 = 𝑖 → (ℤ≥‘𝑘) = (ℤ≥‘𝑖))
2	1	raleqdv 3323	. . . . . . 7 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥))
3	2	cbvrexvw 3245	. . . . . 6 ⊢ (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥)
4	3	a1i 11	. . . . 5 ⊢ (𝑥 = 𝑤 → (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥))
5		breq2 5110	. . . . . . 7 ⊢ (𝑥 = 𝑤 → (𝐵 ≤ 𝑥 ↔ 𝐵 ≤ 𝑤))
6	5	ralbidv 3189	. . . . . 6 ⊢ (𝑥 = 𝑤 → (∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
7	6	rexbidv 3190	. . . . 5 ⊢ (𝑥 = 𝑤 → (∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
8	4, 7	bitrd 282	. . . 4 ⊢ (𝑥 = 𝑤 → (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
9	8	cbvrexvw 3245	. . 3 ⊢ (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤)
10	9	a1i 11	. 2 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)𝐵 ≤ 𝑥 ↔ ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
11		breq2 5110	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → (𝐵 ≤ 𝑤 ↔ 𝐵 ≤ 𝑦))
12	11	ralbidv 3189	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → (∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦))
13	12	rexbidv 3190	. . . . . . 7 ⊢ (𝑤 = 𝑦 → (∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦))
14	13	cbvrexvw 3245	. . . . . 6 ⊢ (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
15	14	biimpi 219	. . . . 5 ⊢ (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 → ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
16		uzub.1	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗𝜑
17		nfv 1949	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗 𝑦 ∈ ℝ
18	16, 17	nfan 1934	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑦 ∈ ℝ)
19		nfv 1949	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 𝑖 ∈ 𝑍
20	18, 19	nfan 1934	. . . . . . . . . . 11 ⊢ Ⅎ𝑗((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍)
21		nfra1 3290	. . . . . . . . . . 11 ⊢ Ⅎ𝑗∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦
22	20, 21	nfan 1934	. . . . . . . . . 10 ⊢ Ⅎ𝑗(((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦)
23		nfmpt1 5207	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗(𝑗 ∈ (𝑀...𝑖) ↦ 𝐵)
24	23	nfrn 5940	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵)
25		nfcv 2926	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗ℝ
26		nfcv 2926	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗 <
27	24, 25, 26	nfsup 9467	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )
28		nfcv 2926	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 ≤
29		nfcv 2926	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗𝑦
30	27, 28, 29	nfbr 5155	. . . . . . . . . . 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 2763	. . . . . . . . . 10 ⊢ sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < ) = sup(ran (𝑗 ∈ (𝑀...𝑖) ↦ 𝐵), ℝ, < )
37		eqid 2763	. . . . . . . . . 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 46643	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
43	42	rexlimdva2 3169	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦 → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
44	43	imp 412	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
45	44	rexlimdva2 3169	. . . . . 6 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦 → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
46	45	imp 412	. . . . 5 ⊢ ((𝜑 ∧ ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑦) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
47	15, 46	sylan2 605	. . . 4 ⊢ ((𝜑 ∧ ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤) → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤)
48	47	ex 418	. . 3 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 → ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
49	32, 34	uzidd2 46629	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ 𝑍)
50	49	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤) → 𝑀 ∈ 𝑍)
51	34	raleqi 3321	. . . . . . 7 ⊢ (∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤)
52	51	bilani 510	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤) → ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤)
53		nfv 1949	. . . . . . 7 ⊢ Ⅎ𝑖∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤
54		fveq2 6905	. . . . . . . 8 ⊢ (𝑖 = 𝑀 → (ℤ≥‘𝑖) = (ℤ≥‘𝑀))
55	54	raleqdv 3323	. . . . . . 7 ⊢ (𝑖 = 𝑀 → (∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤))
56	53, 55	rspce 3569	. . . . . 6 ⊢ ((𝑀 ∈ 𝑍 ∧ ∀𝑗 ∈ (ℤ≥‘𝑀)𝐵 ≤ 𝑤) → ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤)
57	50, 52, 56	syl2anc 596	. . . . 5 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤) → ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤)
58	57	ex 418	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 → ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
59	58	reximdva 3179	. . 3 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 → ∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤))
60	48, 59	impbid 215	. 2 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)𝐵 ≤ 𝑤 ↔ ∃𝑤 ∈ ℝ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤))
61		breq2 5110	. . . . 5 ⊢ (𝑤 = 𝑥 → (𝐵 ≤ 𝑤 ↔ 𝐵 ≤ 𝑥))
62	61	ralbidv 3189	. . . 4 ⊢ (𝑤 = 𝑥 → (∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑤 ↔ ∀𝑗 ∈ 𝑍 𝐵 ≤ 𝑥))
63	62	cbvrexvw 3245	. . 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 2147  ∀wral 3080  ∃wrex 3090  ifcif 4485   class class class wbr 5106   ↦ cmpt 5189  ran crn 5656  ‘cfv 6555  (class class class)co 7440  supcsup 9456  ℝcr 11223   < clt 11367   ≤ cle 11368  ℤcz 12717  ℤ_≥cuz 12989  ...cfz 13663

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 7772  ax-cnex 11280  ax-resscn 11281  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-addrcl 11285  ax-mulcl 11286  ax-mulrcl 11287  ax-mulcom 11288  ax-addass 11289  ax-mulass 11290  ax-distr 11291  ax-i2m1 11292  ax-1ne0 11293  ax-1rid 11294  ax-rnegex 11295  ax-rrecex 11296  ax-cnre 11297  ax-pre-lttri 11298  ax-pre-lttrn 11299  ax-pre-ltadd 11300  ax-pre-mulgt0 11301  ax-pre-sup 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-rmo 3369  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 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-er 8742  df-en 8999  df-dom 9000  df-sdom 9001  df-fin 9002  df-sup 9458  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-sub 11567  df-neg 11568  df-nn 12360  df-n0 12631  df-z 12718  df-uz 12990  df-fz 13664  df-fzo 13813

This theorem is used by:  limsupreuz  46950