natglobalincr - Mathbox for Ender Ting

	Mathbox for Ender Ting		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > natglobalincr		Structured version Visualization version GIF version

Theorem natglobalincr 46892

Description: Local monotonicity on half-open integer range implies global monotonicity. Inference form. (Contributed by Ender Ting, 23-Nov-2024.)

**Hypotheses**
Ref	Expression
natglobalincr.1	⊢ ∀𝑘 ∈ (0..^𝑇)(𝐵‘𝑘) < (𝐵‘(𝑘 + 1))
natglobalincr.2	⊢ 𝑇 ∈ ℤ

**Assertion**
Ref	Expression
natglobalincr	⊢ ∀𝑘 ∈ (0..^𝑇)∀𝑡 ∈ ((𝑘 + 1)...𝑇)(𝐵‘𝑘) < (𝐵‘𝑡)

Distinct variable groups: 𝐵,𝑘 𝑇,𝑘,𝑡 Allowed substitution hint: 𝐵(𝑡)

Proof of Theorem natglobalincr Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfzoelz 13699	. . . . 5 ⊢ (𝑘 ∈ (0..^𝑇) → 𝑘 ∈ ℤ)
2	1	peano2zd 12725	. . . 4 ⊢ (𝑘 ∈ (0..^𝑇) → (𝑘 + 1) ∈ ℤ)
3		natglobalincr.2	. . . 4 ⊢ 𝑇 ∈ ℤ
4		elfz1 13552	. . . 4 ⊢ (((𝑘 + 1) ∈ ℤ ∧ 𝑇 ∈ ℤ) → (𝑡 ∈ ((𝑘 + 1)...𝑇) ↔ (𝑡 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑡 ∧ 𝑡 ≤ 𝑇)))
5	2, 3, 4	sylancl 586	. . 3 ⊢ (𝑘 ∈ (0..^𝑇) → (𝑡 ∈ ((𝑘 + 1)...𝑇) ↔ (𝑡 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑡 ∧ 𝑡 ≤ 𝑇)))
6		fveq2 6906	. . . . 5 ⊢ (𝑎 = (𝑘 + 1) → (𝐵‘𝑎) = (𝐵‘(𝑘 + 1)))
7	6	breq2d 5155	. . . 4 ⊢ (𝑎 = (𝑘 + 1) → ((𝐵‘𝑘) < (𝐵‘𝑎) ↔ (𝐵‘𝑘) < (𝐵‘(𝑘 + 1))))
8		fveq2 6906	. . . . 5 ⊢ (𝑎 = 𝑏 → (𝐵‘𝑎) = (𝐵‘𝑏))
9	8	breq2d 5155	. . . 4 ⊢ (𝑎 = 𝑏 → ((𝐵‘𝑘) < (𝐵‘𝑎) ↔ (𝐵‘𝑘) < (𝐵‘𝑏)))
10		fveq2 6906	. . . . 5 ⊢ (𝑎 = (𝑏 + 1) → (𝐵‘𝑎) = (𝐵‘(𝑏 + 1)))
11	10	breq2d 5155	. . . 4 ⊢ (𝑎 = (𝑏 + 1) → ((𝐵‘𝑘) < (𝐵‘𝑎) ↔ (𝐵‘𝑘) < (𝐵‘(𝑏 + 1))))
12		fveq2 6906	. . . . 5 ⊢ (𝑎 = 𝑡 → (𝐵‘𝑎) = (𝐵‘𝑡))
13	12	breq2d 5155	. . . 4 ⊢ (𝑎 = 𝑡 → ((𝐵‘𝑘) < (𝐵‘𝑎) ↔ (𝐵‘𝑘) < (𝐵‘𝑡)))
14		natglobalincr.1	. . . . 5 ⊢ ∀𝑘 ∈ (0..^𝑇)(𝐵‘𝑘) < (𝐵‘(𝑘 + 1))
15	14	rspec 3250	. . . 4 ⊢ (𝑘 ∈ (0..^𝑇) → (𝐵‘𝑘) < (𝐵‘(𝑘 + 1)))
16		df-br 5144	. . . . . . . 8 ⊢ ((𝐵‘𝑘) < (𝐵‘𝑏) ↔ ⟨(𝐵‘𝑘), (𝐵‘𝑏)⟩ ∈ < )
17		ltrelxr 11322	. . . . . . . . 9 ⊢ < ⊆ (ℝ^* × ℝ^*)
18	17	sseli 3979	. . . . . . . 8 ⊢ (⟨(𝐵‘𝑘), (𝐵‘𝑏)⟩ ∈ < → ⟨(𝐵‘𝑘), (𝐵‘𝑏)⟩ ∈ (ℝ^* × ℝ^*))
19	16, 18	sylbi 217	. . . . . . 7 ⊢ ((𝐵‘𝑘) < (𝐵‘𝑏) → ⟨(𝐵‘𝑘), (𝐵‘𝑏)⟩ ∈ (ℝ^* × ℝ^*))
20		opelxp1 5727	. . . . . . 7 ⊢ (⟨(𝐵‘𝑘), (𝐵‘𝑏)⟩ ∈ (ℝ^* × ℝ^) → (𝐵‘𝑘) ∈ ℝ^)
21	19, 20	syl 17	. . . . . 6 ⊢ ((𝐵‘𝑘) < (𝐵‘𝑏) → (𝐵‘𝑘) ∈ ℝ^*)
22	21	3ad2ant3 1136	. . . . 5 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → (𝐵‘𝑘) ∈ ℝ^*)
23		opelxp2 5728	. . . . . . 7 ⊢ (⟨(𝐵‘𝑘), (𝐵‘𝑏)⟩ ∈ (ℝ^* × ℝ^) → (𝐵‘𝑏) ∈ ℝ^)
24	19, 23	syl 17	. . . . . 6 ⊢ ((𝐵‘𝑘) < (𝐵‘𝑏) → (𝐵‘𝑏) ∈ ℝ^*)
25	24	3ad2ant3 1136	. . . . 5 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → (𝐵‘𝑏) ∈ ℝ^*)
26		0red 11264	. . . . . . . 8 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → 0 ∈ ℝ)
27		simp1 1137	. . . . . . . . 9 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → 𝑘 ∈ (0..^𝑇))
28		zre 12617	. . . . . . . . 9 ⊢ (𝑘 ∈ ℤ → 𝑘 ∈ ℝ)
29		peano2re 11434	. . . . . . . . 9 ⊢ (𝑘 ∈ ℝ → (𝑘 + 1) ∈ ℝ)
30	27, 1, 28, 29	4syl 19	. . . . . . . 8 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → (𝑘 + 1) ∈ ℝ)
31		simp21 1207	. . . . . . . . 9 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → 𝑏 ∈ ℤ)
32	31	zred 12722	. . . . . . . 8 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → 𝑏 ∈ ℝ)
33		elfzole1 13707	. . . . . . . . . 10 ⊢ (𝑘 ∈ (0..^𝑇) → 0 ≤ 𝑘)
34	28	ltp1d 12198	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ℤ → 𝑘 < (𝑘 + 1))
35	1, 34	syl 17	. . . . . . . . . 10 ⊢ (𝑘 ∈ (0..^𝑇) → 𝑘 < (𝑘 + 1))
36		0red 11264	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ℝ → 0 ∈ ℝ)
37		id 22	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ℝ → 𝑘 ∈ ℝ)
38	36, 37, 29	3jca 1129	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ℝ → (0 ∈ ℝ ∧ 𝑘 ∈ ℝ ∧ (𝑘 + 1) ∈ ℝ))
39		leltletr 11352	. . . . . . . . . . 11 ⊢ ((0 ∈ ℝ ∧ 𝑘 ∈ ℝ ∧ (𝑘 + 1) ∈ ℝ) → ((0 ≤ 𝑘 ∧ 𝑘 < (𝑘 + 1)) → 0 ≤ (𝑘 + 1)))
40	1, 28, 38, 39	4syl 19	. . . . . . . . . 10 ⊢ (𝑘 ∈ (0..^𝑇) → ((0 ≤ 𝑘 ∧ 𝑘 < (𝑘 + 1)) → 0 ≤ (𝑘 + 1)))
41	33, 35, 40	mp2and 699	. . . . . . . . 9 ⊢ (𝑘 ∈ (0..^𝑇) → 0 ≤ (𝑘 + 1))
42	41	3ad2ant1 1134	. . . . . . . 8 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → 0 ≤ (𝑘 + 1))
43		simp22 1208	. . . . . . . 8 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → (𝑘 + 1) ≤ 𝑏)
44	26, 30, 32, 42, 43	letrd 11418	. . . . . . 7 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → 0 ≤ 𝑏)
45		simp23 1209	. . . . . . 7 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → 𝑏 < 𝑇)
46		0zd 12625	. . . . . . . . . 10 ⊢ (𝑏 ∈ ℤ → 0 ∈ ℤ)
47	3	a1i 11	. . . . . . . . . 10 ⊢ (𝑏 ∈ ℤ → 𝑇 ∈ ℤ)
48		elfzo 13701	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ℤ ∧ 0 ∈ ℤ ∧ 𝑇 ∈ ℤ) → (𝑏 ∈ (0..^𝑇) ↔ (0 ≤ 𝑏 ∧ 𝑏 < 𝑇)))
49	46, 47, 48	mpd3an23 1465	. . . . . . . . 9 ⊢ (𝑏 ∈ ℤ → (𝑏 ∈ (0..^𝑇) ↔ (0 ≤ 𝑏 ∧ 𝑏 < 𝑇)))
50		fveq2 6906	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑏 → (𝐵‘𝑘) = (𝐵‘𝑏))
51		fvoveq1 7454	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑏 → (𝐵‘(𝑘 + 1)) = (𝐵‘(𝑏 + 1)))
52	50, 51	breq12d 5156	. . . . . . . . . 10 ⊢ (𝑘 = 𝑏 → ((𝐵‘𝑘) < (𝐵‘(𝑘 + 1)) ↔ (𝐵‘𝑏) < (𝐵‘(𝑏 + 1))))
53	52, 14	vtoclri 3590	. . . . . . . . 9 ⊢ (𝑏 ∈ (0..^𝑇) → (𝐵‘𝑏) < (𝐵‘(𝑏 + 1)))
54	49, 53	biimtrrdi 254	. . . . . . . 8 ⊢ (𝑏 ∈ ℤ → ((0 ≤ 𝑏 ∧ 𝑏 < 𝑇) → (𝐵‘𝑏) < (𝐵‘(𝑏 + 1))))
55	31, 54	syl 17	. . . . . . 7 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → ((0 ≤ 𝑏 ∧ 𝑏 < 𝑇) → (𝐵‘𝑏) < (𝐵‘(𝑏 + 1))))
56	44, 45, 55	mp2and 699	. . . . . 6 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → (𝐵‘𝑏) < (𝐵‘(𝑏 + 1)))
57		df-br 5144	. . . . . . 7 ⊢ ((𝐵‘𝑏) < (𝐵‘(𝑏 + 1)) ↔ ⟨(𝐵‘𝑏), (𝐵‘(𝑏 + 1))⟩ ∈ < )
58	17	sseli 3979	. . . . . . 7 ⊢ (⟨(𝐵‘𝑏), (𝐵‘(𝑏 + 1))⟩ ∈ < → ⟨(𝐵‘𝑏), (𝐵‘(𝑏 + 1))⟩ ∈ (ℝ^* × ℝ^*))
59	57, 58	sylbi 217	. . . . . 6 ⊢ ((𝐵‘𝑏) < (𝐵‘(𝑏 + 1)) → ⟨(𝐵‘𝑏), (𝐵‘(𝑏 + 1))⟩ ∈ (ℝ^* × ℝ^*))
60		opelxp2 5728	. . . . . 6 ⊢ (⟨(𝐵‘𝑏), (𝐵‘(𝑏 + 1))⟩ ∈ (ℝ^* × ℝ^) → (𝐵‘(𝑏 + 1)) ∈ ℝ^)
61	56, 59, 60	3syl 18	. . . . 5 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → (𝐵‘(𝑏 + 1)) ∈ ℝ^*)
62		simp3 1139	. . . . 5 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → (𝐵‘𝑘) < (𝐵‘𝑏))
63	22, 25, 61, 62, 56	xrlttrd 13201	. . . 4 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑏 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑏 ∧ 𝑏 < 𝑇) ∧ (𝐵‘𝑘) < (𝐵‘𝑏)) → (𝐵‘𝑘) < (𝐵‘(𝑏 + 1)))
64		elfzoel2 13698	. . . 4 ⊢ (𝑘 ∈ (0..^𝑇) → 𝑇 ∈ ℤ)
65		elfzop1le2 13712	. . . 4 ⊢ (𝑘 ∈ (0..^𝑇) → (𝑘 + 1) ≤ 𝑇)
66	7, 9, 11, 13, 15, 63, 2, 64, 65	fzindd 12720	. . 3 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ (𝑡 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑡 ∧ 𝑡 ≤ 𝑇)) → (𝐵‘𝑘) < (𝐵‘𝑡))
67	5, 66	sylbida 592	. 2 ⊢ ((𝑘 ∈ (0..^𝑇) ∧ 𝑡 ∈ ((𝑘 + 1)...𝑇)) → (𝐵‘𝑘) < (𝐵‘𝑡))
68	67	rgen2 3199	1 ⊢ ∀𝑘 ∈ (0..^𝑇)∀𝑡 ∈ ((𝑘 + 1)...𝑇)(𝐵‘𝑘) < (𝐵‘𝑡)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ∀wral 3061 ⟨cop 4632 class class class wbr 5143 × cxp 5683 ‘cfv 6561 (class class class)co 7431 ℝcr 11154 0cc0 11155 1c1 11156 + caddc 11158 ℝ^*cxr 11294 < clt 11295 ≤ cle 11296 ℤcz 12613 ...cfz 13547 ..^cfzo 13694

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-er 8745 df-en 8986 df-dom 8987 df-sdom 8988 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-n0 12527 df-z 12614 df-uz 12879 df-fz 13548 df-fzo 13695

This theorem is referenced by: (None)

W3C validator