monoords - Mathbox for Glauco Siliprandi

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

Theorem monoords 45840

Description: Ordering relation for a strictly monotonic sequence, increasing case. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
monoords.fk	⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ)
monoords.flt	⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → (𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))
monoords.i	⊢ (𝜑 → 𝐼 ∈ (𝑀...𝑁))
monoords.j	⊢ (𝜑 → 𝐽 ∈ (𝑀...𝑁))
monoords.iltj	⊢ (𝜑 → 𝐼 < 𝐽)

**Assertion**
Ref	Expression
monoords	⊢ (𝜑 → (𝐹‘𝐼) < (𝐹‘𝐽))

Distinct variable groups: 𝑘,𝐹 𝑘,𝐼 𝑘,𝐽 𝑘,𝑀 𝑘,𝑁 𝜑,𝑘

Proof of Theorem monoords Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		monoords.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ (𝑀...𝑁))
2	1	ancli 556	. . 3 ⊢ (𝜑 → (𝜑 ∧ 𝐼 ∈ (𝑀...𝑁)))
3		eleq1 2849	. . . . . 6 ⊢ (𝑘 = 𝐼 → (𝑘 ∈ (𝑀...𝑁) ↔ 𝐼 ∈ (𝑀...𝑁)))
4	3	anbi2d 639	. . . . 5 ⊢ (𝑘 = 𝐼 → ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) ↔ (𝜑 ∧ 𝐼 ∈ (𝑀...𝑁))))
5		fveq2 6863	. . . . . 6 ⊢ (𝑘 = 𝐼 → (𝐹‘𝑘) = (𝐹‘𝐼))
6	5	eleq1d 2846	. . . . 5 ⊢ (𝑘 = 𝐼 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝐼) ∈ ℝ))
7	4, 6	imbi12d 346	. . . 4 ⊢ (𝑘 = 𝐼 → (((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ) ↔ ((𝜑 ∧ 𝐼 ∈ (𝑀...𝑁)) → (𝐹‘𝐼) ∈ ℝ)))
8		monoords.fk	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ)
9	7, 8	vtoclg 3521	. . 3 ⊢ (𝐼 ∈ (𝑀...𝑁) → ((𝜑 ∧ 𝐼 ∈ (𝑀...𝑁)) → (𝐹‘𝐼) ∈ ℝ))
10	1, 2, 9	sylc 65	. 2 ⊢ (𝜑 → (𝐹‘𝐼) ∈ ℝ)
11		elfzel1 13525	. . . . . . 7 ⊢ (𝐼 ∈ (𝑀...𝑁) → 𝑀 ∈ ℤ)
12	1, 11	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
13	1	elfzelzd 13527	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ ℤ)
14		elfzle1 13529	. . . . . . 7 ⊢ (𝐼 ∈ (𝑀...𝑁) → 𝑀 ≤ 𝐼)
15	1, 14	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑀 ≤ 𝐼)
16		eluz2 12842	. . . . . 6 ⊢ (𝐼 ∈ (ℤ_≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀 ≤ 𝐼))
17	12, 13, 15, 16	syl3anbrc 1356	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ (ℤ_≥‘𝑀))
18		elfzuz2 13531	. . . . . . 7 ⊢ (𝐼 ∈ (𝑀...𝑁) → 𝑁 ∈ (ℤ_≥‘𝑀))
19	1, 18	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
20		eluzelz 12846	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℤ)
21	19, 20	syl 17	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ)
22	13	zred 12674	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ ℝ)
23		monoords.j	. . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ (𝑀...𝑁))
24	23	elfzelzd 13527	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ ℤ)
25	24	zred 12674	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ ℝ)
26	21	zred 12674	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℝ)
27		monoords.iltj	. . . . . 6 ⊢ (𝜑 → 𝐼 < 𝐽)
28		elfzle2 13530	. . . . . . 7 ⊢ (𝐽 ∈ (𝑀...𝑁) → 𝐽 ≤ 𝑁)
29	23, 28	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐽 ≤ 𝑁)
30	22, 25, 26, 27, 29	ltletrd 11340	. . . . 5 ⊢ (𝜑 → 𝐼 < 𝑁)
31		elfzo2 13664	. . . . 5 ⊢ (𝐼 ∈ (𝑀..^𝑁) ↔ (𝐼 ∈ (ℤ_≥‘𝑀) ∧ 𝑁 ∈ ℤ ∧ 𝐼 < 𝑁))
32	17, 21, 30, 31	syl3anbrc 1356	. . . 4 ⊢ (𝜑 → 𝐼 ∈ (𝑀..^𝑁))
33		fzofzp1 13767	. . . 4 ⊢ (𝐼 ∈ (𝑀..^𝑁) → (𝐼 + 1) ∈ (𝑀...𝑁))
34	32, 33	syl 17	. . 3 ⊢ (𝜑 → (𝐼 + 1) ∈ (𝑀...𝑁))
35	34	ancli 556	. . 3 ⊢ (𝜑 → (𝜑 ∧ (𝐼 + 1) ∈ (𝑀...𝑁)))
36		eleq1 2849	. . . . . 6 ⊢ (𝑘 = (𝐼 + 1) → (𝑘 ∈ (𝑀...𝑁) ↔ (𝐼 + 1) ∈ (𝑀...𝑁)))
37	36	anbi2d 639	. . . . 5 ⊢ (𝑘 = (𝐼 + 1) → ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) ↔ (𝜑 ∧ (𝐼 + 1) ∈ (𝑀...𝑁))))
38		fveq2 6863	. . . . . 6 ⊢ (𝑘 = (𝐼 + 1) → (𝐹‘𝑘) = (𝐹‘(𝐼 + 1)))
39	38	eleq1d 2846	. . . . 5 ⊢ (𝑘 = (𝐼 + 1) → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘(𝐼 + 1)) ∈ ℝ))
40	37, 39	imbi12d 346	. . . 4 ⊢ (𝑘 = (𝐼 + 1) → (((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ) ↔ ((𝜑 ∧ (𝐼 + 1) ∈ (𝑀...𝑁)) → (𝐹‘(𝐼 + 1)) ∈ ℝ)))
41	40, 8	vtoclg 3521	. . 3 ⊢ ((𝐼 + 1) ∈ (𝑀...𝑁) → ((𝜑 ∧ (𝐼 + 1) ∈ (𝑀...𝑁)) → (𝐹‘(𝐼 + 1)) ∈ ℝ))
42	34, 35, 41	sylc 65	. 2 ⊢ (𝜑 → (𝐹‘(𝐼 + 1)) ∈ ℝ)
43	23	ancli 556	. . 3 ⊢ (𝜑 → (𝜑 ∧ 𝐽 ∈ (𝑀...𝑁)))
44		eleq1 2849	. . . . . 6 ⊢ (𝑘 = 𝐽 → (𝑘 ∈ (𝑀...𝑁) ↔ 𝐽 ∈ (𝑀...𝑁)))
45	44	anbi2d 639	. . . . 5 ⊢ (𝑘 = 𝐽 → ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) ↔ (𝜑 ∧ 𝐽 ∈ (𝑀...𝑁))))
46		fveq2 6863	. . . . . 6 ⊢ (𝑘 = 𝐽 → (𝐹‘𝑘) = (𝐹‘𝐽))
47	46	eleq1d 2846	. . . . 5 ⊢ (𝑘 = 𝐽 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝐽) ∈ ℝ))
48	45, 47	imbi12d 346	. . . 4 ⊢ (𝑘 = 𝐽 → (((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ) ↔ ((𝜑 ∧ 𝐽 ∈ (𝑀...𝑁)) → (𝐹‘𝐽) ∈ ℝ)))
49	48, 8	vtoclg 3521	. . 3 ⊢ (𝐽 ∈ (𝑀...𝑁) → ((𝜑 ∧ 𝐽 ∈ (𝑀...𝑁)) → (𝐹‘𝐽) ∈ ℝ))
50	23, 43, 49	sylc 65	. 2 ⊢ (𝜑 → (𝐹‘𝐽) ∈ ℝ)
51	32	ancli 556	. . 3 ⊢ (𝜑 → (𝜑 ∧ 𝐼 ∈ (𝑀..^𝑁)))
52		eleq1 2849	. . . . . 6 ⊢ (𝑘 = 𝐼 → (𝑘 ∈ (𝑀..^𝑁) ↔ 𝐼 ∈ (𝑀..^𝑁)))
53	52	anbi2d 639	. . . . 5 ⊢ (𝑘 = 𝐼 → ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ↔ (𝜑 ∧ 𝐼 ∈ (𝑀..^𝑁))))
54		fvoveq1 7415	. . . . . 6 ⊢ (𝑘 = 𝐼 → (𝐹‘(𝑘 + 1)) = (𝐹‘(𝐼 + 1)))
55	5, 54	breq12d 5112	. . . . 5 ⊢ (𝑘 = 𝐼 → ((𝐹‘𝑘) < (𝐹‘(𝑘 + 1)) ↔ (𝐹‘𝐼) < (𝐹‘(𝐼 + 1))))
56	53, 55	imbi12d 346	. . . 4 ⊢ (𝑘 = 𝐼 → (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → (𝐹‘𝑘) < (𝐹‘(𝑘 + 1))) ↔ ((𝜑 ∧ 𝐼 ∈ (𝑀..^𝑁)) → (𝐹‘𝐼) < (𝐹‘(𝐼 + 1)))))
57		monoords.flt	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → (𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))
58	56, 57	vtoclg 3521	. . 3 ⊢ (𝐼 ∈ (𝑀..^𝑁) → ((𝜑 ∧ 𝐼 ∈ (𝑀..^𝑁)) → (𝐹‘𝐼) < (𝐹‘(𝐼 + 1))))
59	32, 51, 58	sylc 65	. 2 ⊢ (𝜑 → (𝐹‘𝐼) < (𝐹‘(𝐼 + 1)))
60	13	peano2zd 12677	. . . 4 ⊢ (𝜑 → (𝐼 + 1) ∈ ℤ)
61		zltp1le 12618	. . . . . 6 ⊢ ((𝐼 ∈ ℤ ∧ 𝐽 ∈ ℤ) → (𝐼 < 𝐽 ↔ (𝐼 + 1) ≤ 𝐽))
62	13, 24, 61	syl2anc 593	. . . . 5 ⊢ (𝜑 → (𝐼 < 𝐽 ↔ (𝐼 + 1) ≤ 𝐽))
63	27, 62	mpbid 234	. . . 4 ⊢ (𝜑 → (𝐼 + 1) ≤ 𝐽)
64		eluz2 12842	. . . 4 ⊢ (𝐽 ∈ (ℤ_≥‘(𝐼 + 1)) ↔ ((𝐼 + 1) ∈ ℤ ∧ 𝐽 ∈ ℤ ∧ (𝐼 + 1) ≤ 𝐽))
65	60, 24, 63, 64	syl3anbrc 1356	. . 3 ⊢ (𝜑 → 𝐽 ∈ (ℤ_≥‘(𝐼 + 1)))
66	12	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑀 ∈ ℤ)
67	21	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑁 ∈ ℤ)
68		elfzelz 13526	. . . . . 6 ⊢ (𝑘 ∈ ((𝐼 + 1)...𝐽) → 𝑘 ∈ ℤ)
69	68	adantl 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑘 ∈ ℤ)
70	66	zred 12674	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑀 ∈ ℝ)
71	69	zred 12674	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑘 ∈ ℝ)
72	60	zred 12674	. . . . . . . 8 ⊢ (𝜑 → (𝐼 + 1) ∈ ℝ)
73	72	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → (𝐼 + 1) ∈ ℝ)
74	22	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝐼 ∈ ℝ)
75	15	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑀 ≤ 𝐼)
76	74	ltp1d 12119	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝐼 < (𝐼 + 1))
77	70, 74, 73, 75, 76	lelttrd 11338	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑀 < (𝐼 + 1))
78		elfzle1 13529	. . . . . . . 8 ⊢ (𝑘 ∈ ((𝐼 + 1)...𝐽) → (𝐼 + 1) ≤ 𝑘)
79	78	adantl 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → (𝐼 + 1) ≤ 𝑘)
80	70, 73, 71, 77, 79	ltletrd 11340	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑀 < 𝑘)
81	70, 71, 80	ltled 11328	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑀 ≤ 𝑘)
82	25	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝐽 ∈ ℝ)
83	67	zred 12674	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑁 ∈ ℝ)
84		elfzle2 13530	. . . . . . 7 ⊢ (𝑘 ∈ ((𝐼 + 1)...𝐽) → 𝑘 ≤ 𝐽)
85	84	adantl 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑘 ≤ 𝐽)
86	29	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝐽 ≤ 𝑁)
87	71, 82, 83, 85, 86	letrd 11337	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑘 ≤ 𝑁)
88	66, 67, 69, 81, 87	elfzd 13517	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → 𝑘 ∈ (𝑀...𝑁))
89	88, 8	syldan 600	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...𝐽)) → (𝐹‘𝑘) ∈ ℝ)
90	12	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑀 ∈ ℤ)
91	21	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑁 ∈ ℤ)
92		elfzelz 13526	. . . . . . 7 ⊢ (𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1)) → 𝑘 ∈ ℤ)
93	92	adantl 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑘 ∈ ℤ)
94	90	zred 12674	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑀 ∈ ℝ)
95	93	zred 12674	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑘 ∈ ℝ)
96	72	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝐼 + 1) ∈ ℝ)
97	12	zred 12674	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℝ)
98	22	ltp1d 12119	. . . . . . . . . 10 ⊢ (𝜑 → 𝐼 < (𝐼 + 1))
99	97, 22, 72, 15, 98	lelttrd 11338	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 < (𝐼 + 1))
100	99	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑀 < (𝐼 + 1))
101		elfzle1 13529	. . . . . . . . 9 ⊢ (𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1)) → (𝐼 + 1) ≤ 𝑘)
102	101	adantl 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝐼 + 1) ≤ 𝑘)
103	94, 96, 95, 100, 102	ltletrd 11340	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑀 < 𝑘)
104	94, 95, 103	ltled 11328	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑀 ≤ 𝑘)
105	91	zred 12674	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑁 ∈ ℝ)
106		peano2rem 11495	. . . . . . . . . 10 ⊢ (𝐽 ∈ ℝ → (𝐽 − 1) ∈ ℝ)
107	25, 106	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝐽 − 1) ∈ ℝ)
108	107	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝐽 − 1) ∈ ℝ)
109		elfzle2 13530	. . . . . . . . 9 ⊢ (𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1)) → 𝑘 ≤ (𝐽 − 1))
110	109	adantl 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑘 ≤ (𝐽 − 1))
111	25	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝐽 ∈ ℝ)
112	111	ltm1d 12121	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝐽 − 1) < 𝐽)
113	29	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝐽 ≤ 𝑁)
114	108, 111, 105, 112, 113	ltletrd 11340	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝐽 − 1) < 𝑁)
115	95, 108, 105, 110, 114	lelttrd 11338	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑘 < 𝑁)
116	95, 105, 115	ltled 11328	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑘 ≤ 𝑁)
117	90, 91, 93, 104, 116	elfzd 13517	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑘 ∈ (𝑀...𝑁))
118	117, 8	syldan 600	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝐹‘𝑘) ∈ ℝ)
119		peano2zm 12611	. . . . . . 7 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ)
120	91, 119	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝑁 − 1) ∈ ℤ)
121	120	zred 12674	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝑁 − 1) ∈ ℝ)
122		1red 11179	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℝ)
123	25, 26, 122, 29	lesub1dd 11800	. . . . . . . 8 ⊢ (𝜑 → (𝐽 − 1) ≤ (𝑁 − 1))
124	123	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝐽 − 1) ≤ (𝑁 − 1))
125	95, 108, 121, 110, 124	letrd 11337	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑘 ≤ (𝑁 − 1))
126	90, 120, 93, 104, 125	elfzd 13517	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → 𝑘 ∈ (𝑀...(𝑁 − 1)))
127		simpr 488	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → 𝑘 ∈ (𝑀...(𝑁 − 1)))
128		fzoval 13662	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℤ → (𝑀..^𝑁) = (𝑀...(𝑁 − 1)))
129	21, 128	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀..^𝑁) = (𝑀...(𝑁 − 1)))
130	129	eqcomd 2767	. . . . . . . . 9 ⊢ (𝜑 → (𝑀...(𝑁 − 1)) = (𝑀..^𝑁))
131	130	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → (𝑀...(𝑁 − 1)) = (𝑀..^𝑁))
132	127, 131	eleqtrd 2863	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → 𝑘 ∈ (𝑀..^𝑁))
133		fzofzp1 13767	. . . . . . 7 ⊢ (𝑘 ∈ (𝑀..^𝑁) → (𝑘 + 1) ∈ (𝑀...𝑁))
134	132, 133	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → (𝑘 + 1) ∈ (𝑀...𝑁))
135		simpl 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → 𝜑)
136	135, 134	jca 519	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → (𝜑 ∧ (𝑘 + 1) ∈ (𝑀...𝑁)))
137		eleq1 2849	. . . . . . . . 9 ⊢ (𝑗 = (𝑘 + 1) → (𝑗 ∈ (𝑀...𝑁) ↔ (𝑘 + 1) ∈ (𝑀...𝑁)))
138	137	anbi2d 639	. . . . . . . 8 ⊢ (𝑗 = (𝑘 + 1) → ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) ↔ (𝜑 ∧ (𝑘 + 1) ∈ (𝑀...𝑁))))
139		fveq2 6863	. . . . . . . . 9 ⊢ (𝑗 = (𝑘 + 1) → (𝐹‘𝑗) = (𝐹‘(𝑘 + 1)))
140	139	eleq1d 2846	. . . . . . . 8 ⊢ (𝑗 = (𝑘 + 1) → ((𝐹‘𝑗) ∈ ℝ ↔ (𝐹‘(𝑘 + 1)) ∈ ℝ))
141	138, 140	imbi12d 346	. . . . . . 7 ⊢ (𝑗 = (𝑘 + 1) → (((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → (𝐹‘𝑗) ∈ ℝ) ↔ ((𝜑 ∧ (𝑘 + 1) ∈ (𝑀...𝑁)) → (𝐹‘(𝑘 + 1)) ∈ ℝ)))
142		eleq1 2849	. . . . . . . . . 10 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ (𝑀...𝑁) ↔ 𝑗 ∈ (𝑀...𝑁)))
143	142	anbi2d 639	. . . . . . . . 9 ⊢ (𝑘 = 𝑗 → ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) ↔ (𝜑 ∧ 𝑗 ∈ (𝑀...𝑁))))
144		fveq2 6863	. . . . . . . . . 10 ⊢ (𝑘 = 𝑗 → (𝐹‘𝑘) = (𝐹‘𝑗))
145	144	eleq1d 2846	. . . . . . . . 9 ⊢ (𝑘 = 𝑗 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑗) ∈ ℝ))
146	143, 145	imbi12d 346	. . . . . . . 8 ⊢ (𝑘 = 𝑗 → (((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ) ↔ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → (𝐹‘𝑗) ∈ ℝ)))
147	146, 8	chvarvv 2008	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → (𝐹‘𝑗) ∈ ℝ)
148	141, 147	vtoclg 3521	. . . . . 6 ⊢ ((𝑘 + 1) ∈ (𝑀...𝑁) → ((𝜑 ∧ (𝑘 + 1) ∈ (𝑀...𝑁)) → (𝐹‘(𝑘 + 1)) ∈ ℝ))
149	134, 136, 148	sylc 65	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → (𝐹‘(𝑘 + 1)) ∈ ℝ)
150	126, 149	syldan 600	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝐹‘(𝑘 + 1)) ∈ ℝ)
151	132, 57	syldan 600	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → (𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))
152	126, 151	syldan 600	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))
153	118, 150, 152	ltled 11328	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐼 + 1)...(𝐽 − 1))) → (𝐹‘𝑘) ≤ (𝐹‘(𝑘 + 1)))
154	65, 89, 153	monoord 14042	. 2 ⊢ (𝜑 → (𝐹‘(𝐼 + 1)) ≤ (𝐹‘𝐽))
155	10, 42, 50, 59, 154	ltletrd 11340	1 ⊢ (𝜑 → (𝐹‘𝐼) < (𝐹‘𝐽))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 class class class wbr 5099 ‘cfv 6517 (class class class)co 7392 ℝcr 11069 1c1 11071 + caddc 11073 < clt 11213 ≤ cle 11214 − cmin 11411 ℤcz 12565 ℤ_≥cuz 12836 ...cfz 13509 ..^cfzo 13656

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-nn 12208 df-n0 12479 df-z 12566 df-uz 12837 df-fz 13510 df-fzo 13657

This theorem is referenced by: fourierdlem34 46679

W3C validator