Theorem smonoord 43538

Description: Ordering relation for a strictly monotonic sequence, increasing case. Analogous to monoord 13403 (except that the case 𝑀 = 𝑁 must be excluded). Duplicate of monoords 41570? (Contributed by AV, 12-Jul-2020.)

Hypotheses

Ref	Expression
smonoord.0	⊢ (𝜑 → 𝑀 ∈ ℤ)
smonoord.1	⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))
smonoord.2	⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ)
smonoord.3	⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → (𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))

Assertion

Ref	Expression
smonoord	⊢ (𝜑 → (𝐹‘𝑀) < (𝐹‘𝑁))

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

Proof of Theorem smonoord

Dummy variables 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		smonoord.1	. . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))
2		eluzfz2 12918	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑁 ∈ ((𝑀 + 1)...𝑁))
3	1, 2	syl 17	. 2 ⊢ (𝜑 → 𝑁 ∈ ((𝑀 + 1)...𝑁))
4		eleq1 2903	. . . . . 6 ⊢ (𝑥 = (𝑀 + 1) → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ (𝑀 + 1) ∈ ((𝑀 + 1)...𝑁)))
5		fveq2 6673	. . . . . . 7 ⊢ (𝑥 = (𝑀 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑀 + 1)))
6	5	breq2d 5081	. . . . . 6 ⊢ (𝑥 = (𝑀 + 1) → ((𝐹‘𝑀) < (𝐹‘𝑥) ↔ (𝐹‘𝑀) < (𝐹‘(𝑀 + 1))))
7	4, 6	imbi12d 347	. . . . 5 ⊢ (𝑥 = (𝑀 + 1) → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥)) ↔ ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘(𝑀 + 1)))))
8	7	imbi2d 343	. . . 4 ⊢ (𝑥 = (𝑀 + 1) → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥))) ↔ (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘(𝑀 + 1))))))
9		eleq1 2903	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ 𝑛 ∈ ((𝑀 + 1)...𝑁)))
10		fveq2 6673	. . . . . . 7 ⊢ (𝑥 = 𝑛 → (𝐹‘𝑥) = (𝐹‘𝑛))
11	10	breq2d 5081	. . . . . 6 ⊢ (𝑥 = 𝑛 → ((𝐹‘𝑀) < (𝐹‘𝑥) ↔ (𝐹‘𝑀) < (𝐹‘𝑛)))
12	9, 11	imbi12d 347	. . . . 5 ⊢ (𝑥 = 𝑛 → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥)) ↔ (𝑛 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑛))))
13	12	imbi2d 343	. . . 4 ⊢ (𝑥 = 𝑛 → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥))) ↔ (𝜑 → (𝑛 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑛)))))
14		eleq1 2903	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)))
15		fveq2 6673	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑛 + 1)))
16	15	breq2d 5081	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → ((𝐹‘𝑀) < (𝐹‘𝑥) ↔ (𝐹‘𝑀) < (𝐹‘(𝑛 + 1))))
17	14, 16	imbi12d 347	. . . . 5 ⊢ (𝑥 = (𝑛 + 1) → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥)) ↔ ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘(𝑛 + 1)))))
18	17	imbi2d 343	. . . 4 ⊢ (𝑥 = (𝑛 + 1) → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥))) ↔ (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘(𝑛 + 1))))))
19		eleq1 2903	. . . . . 6 ⊢ (𝑥 = 𝑁 → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ 𝑁 ∈ ((𝑀 + 1)...𝑁)))
20		fveq2 6673	. . . . . . 7 ⊢ (𝑥 = 𝑁 → (𝐹‘𝑥) = (𝐹‘𝑁))
21	20	breq2d 5081	. . . . . 6 ⊢ (𝑥 = 𝑁 → ((𝐹‘𝑀) < (𝐹‘𝑥) ↔ (𝐹‘𝑀) < (𝐹‘𝑁)))
22	19, 21	imbi12d 347	. . . . 5 ⊢ (𝑥 = 𝑁 → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥)) ↔ (𝑁 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑁))))
23	22	imbi2d 343	. . . 4 ⊢ (𝑥 = 𝑁 → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥))) ↔ (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑁)))))
24		smonoord.0	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ)
25		eluzp1m1 12271	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑀 + 1))) → (𝑁 − 1) ∈ (ℤ≥‘𝑀))
26	24, 1, 25	syl2anc 586	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 1) ∈ (ℤ≥‘𝑀))
27		eluzfz1 12917	. . . . . . . 8 ⊢ ((𝑁 − 1) ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...(𝑁 − 1)))
28	26, 27	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ (𝑀...(𝑁 − 1)))
29		smonoord.3	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → (𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))
30	29	ralrimiva 3185	. . . . . . 7 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...(𝑁 − 1))(𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))
31		fveq2 6673	. . . . . . . . 9 ⊢ (𝑘 = 𝑀 → (𝐹‘𝑘) = (𝐹‘𝑀))
32		fvoveq1 7182	. . . . . . . . 9 ⊢ (𝑘 = 𝑀 → (𝐹‘(𝑘 + 1)) = (𝐹‘(𝑀 + 1)))
33	31, 32	breq12d 5082	. . . . . . . 8 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) < (𝐹‘(𝑘 + 1)) ↔ (𝐹‘𝑀) < (𝐹‘(𝑀 + 1))))
34	33	rspcv 3621	. . . . . . 7 ⊢ (𝑀 ∈ (𝑀...(𝑁 − 1)) → (∀𝑘 ∈ (𝑀...(𝑁 − 1))(𝐹‘𝑘) < (𝐹‘(𝑘 + 1)) → (𝐹‘𝑀) < (𝐹‘(𝑀 + 1))))
35	28, 30, 34	sylc 65	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝑀) < (𝐹‘(𝑀 + 1)))
36	35	a1d 25	. . . . 5 ⊢ (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘(𝑀 + 1))))
37	36	a1i 11	. . . 4 ⊢ ((𝑀 + 1) ∈ ℤ → (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘(𝑀 + 1)))))
38		peano2fzr 12923	. . . . . . . 8 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → 𝑛 ∈ ((𝑀 + 1)...𝑁))
39	38	adantll 712	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → 𝑛 ∈ ((𝑀 + 1)...𝑁))
40	39	ex 415	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → 𝑛 ∈ ((𝑀 + 1)...𝑁)))
41	40	imim1d 82	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) → ((𝑛 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑛)) → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑛))))
42		peano2uzr 12306	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑛 ∈ (ℤ≥‘𝑀))
43	42	ex 415	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑛 ∈ (ℤ≥‘𝑀)))
44	43, 24	syl11 33	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → (𝜑 → 𝑛 ∈ (ℤ≥‘𝑀)))
45	44	adantr 483	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → (𝜑 → 𝑛 ∈ (ℤ≥‘𝑀)))
46	45	impcom 410	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (ℤ≥‘𝑀))
47		eluzelz 12256	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑛 ∈ ℤ)
48	47	adantr 483	. . . . . . . . . 10 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → 𝑛 ∈ ℤ)
49	48	adantl 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ ℤ)
50		elfzuz3 12908	. . . . . . . . . 10 ⊢ ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → 𝑁 ∈ (ℤ≥‘(𝑛 + 1)))
51	50	ad2antll 727	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑁 ∈ (ℤ≥‘(𝑛 + 1)))
52		eluzp1m1 12271	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑁 − 1) ∈ (ℤ≥‘𝑛))
53	49, 51, 52	syl2anc 586	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑁 − 1) ∈ (ℤ≥‘𝑛))
54		elfzuzb 12905	. . . . . . . 8 ⊢ (𝑛 ∈ (𝑀...(𝑁 − 1)) ↔ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑁 − 1) ∈ (ℤ≥‘𝑛)))
55	46, 53, 54	sylanbrc 585	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (𝑀...(𝑁 − 1)))
56	30	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ∀𝑘 ∈ (𝑀...(𝑁 − 1))(𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))
57		fveq2 6673	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → (𝐹‘𝑘) = (𝐹‘𝑛))
58		fvoveq1 7182	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → (𝐹‘(𝑘 + 1)) = (𝐹‘(𝑛 + 1)))
59	57, 58	breq12d 5082	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → ((𝐹‘𝑘) < (𝐹‘(𝑘 + 1)) ↔ (𝐹‘𝑛) < (𝐹‘(𝑛 + 1))))
60	59	rspcv 3621	. . . . . . 7 ⊢ (𝑛 ∈ (𝑀...(𝑁 − 1)) → (∀𝑘 ∈ (𝑀...(𝑁 − 1))(𝐹‘𝑘) < (𝐹‘(𝑘 + 1)) → (𝐹‘𝑛) < (𝐹‘(𝑛 + 1))))
61	55, 56, 60	sylc 65	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘𝑛) < (𝐹‘(𝑛 + 1)))
62		zre 11988	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
63	62	lep1d 11574	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ ℤ → 𝑀 ≤ (𝑀 + 1))
64	24, 63	jccir 524	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑀 ∈ ℤ ∧ 𝑀 ≤ (𝑀 + 1)))
65		eluzuzle 12255	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≤ (𝑀 + 1)) → (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑁 ∈ (ℤ≥‘𝑀)))
66	64, 1, 65	sylc 65	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
67		eluzfz1 12917	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
68	66, 67	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁))
69		smonoord.2	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ)
70	69	ralrimiva 3185	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ ℝ)
71	31	eleq1d 2900	. . . . . . . . . 10 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑀) ∈ ℝ))
72	71	rspcv 3621	. . . . . . . . 9 ⊢ (𝑀 ∈ (𝑀...𝑁) → (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ ℝ → (𝐹‘𝑀) ∈ ℝ))
73	68, 70, 72	sylc 65	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘𝑀) ∈ ℝ)
74	73	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘𝑀) ∈ ℝ)
75		fzp1ss 12961	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℤ → ((𝑀 + 1)...𝑁) ⊆ (𝑀...𝑁))
76	24, 75	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑀 + 1)...𝑁) ⊆ (𝑀...𝑁))
77	76	sseld 3969	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝑛 + 1) ∈ (𝑀...𝑁)))
78	77	com12 32	. . . . . . . . . . 11 ⊢ ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝜑 → (𝑛 + 1) ∈ (𝑀...𝑁)))
79	78	adantl 484	. . . . . . . . . 10 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → (𝜑 → (𝑛 + 1) ∈ (𝑀...𝑁)))
80	79	impcom 410	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑛 + 1) ∈ (𝑀...𝑁))
81		peano2fzr 12923	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝑛 ∈ (𝑀...𝑁))
82	46, 80, 81	syl2anc 586	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (𝑀...𝑁))
83	70	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ ℝ)
84	57	eleq1d 2900	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑛) ∈ ℝ))
85	84	rspcv 3621	. . . . . . . 8 ⊢ (𝑛 ∈ (𝑀...𝑁) → (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ ℝ → (𝐹‘𝑛) ∈ ℝ))
86	82, 83, 85	sylc 65	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘𝑛) ∈ ℝ)
87		fveq2 6673	. . . . . . . . . 10 ⊢ (𝑘 = (𝑛 + 1) → (𝐹‘𝑘) = (𝐹‘(𝑛 + 1)))
88	87	eleq1d 2900	. . . . . . . . 9 ⊢ (𝑘 = (𝑛 + 1) → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘(𝑛 + 1)) ∈ ℝ))
89	88	rspcv 3621	. . . . . . . 8 ⊢ ((𝑛 + 1) ∈ (𝑀...𝑁) → (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ ℝ → (𝐹‘(𝑛 + 1)) ∈ ℝ))
90	80, 83, 89	sylc 65	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘(𝑛 + 1)) ∈ ℝ)
91		lttr 10720	. . . . . . 7 ⊢ (((𝐹‘𝑀) ∈ ℝ ∧ (𝐹‘𝑛) ∈ ℝ ∧ (𝐹‘(𝑛 + 1)) ∈ ℝ) → (((𝐹‘𝑀) < (𝐹‘𝑛) ∧ (𝐹‘𝑛) < (𝐹‘(𝑛 + 1))) → (𝐹‘𝑀) < (𝐹‘(𝑛 + 1))))
92	74, 86, 90, 91	syl3anc 1367	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (((𝐹‘𝑀) < (𝐹‘𝑛) ∧ (𝐹‘𝑛) < (𝐹‘(𝑛 + 1))) → (𝐹‘𝑀) < (𝐹‘(𝑛 + 1))))
93	61, 92	mpan2d 692	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((𝐹‘𝑀) < (𝐹‘𝑛) → (𝐹‘𝑀) < (𝐹‘(𝑛 + 1))))
94	41, 93	animpimp2impd 842	. . . 4 ⊢ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → ((𝜑 → (𝑛 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑛))) → (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘(𝑛 + 1))))))
95	8, 13, 18, 23, 37, 94	uzind4 12309	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑁))))
96	1, 95	mpcom 38	. 2 ⊢ (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑁)))
97	3, 96	mpd 15	1 ⊢ (𝜑 → (𝐹‘𝑀) < (𝐹‘𝑁))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1536   ∈ wcel 2113  ∀wral 3141   ⊆ wss 3939   class class class wbr 5069  ‘cfv 6358  (class class class)co 7159  ℝcr 10539  1c1 10541   + caddc 10543   < clt 10678   ≤ cle 10679   − cmin 10873  ℤcz 11984  ℤ_≥cuz 12246  ...cfz 12895

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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464  ax-cnex 10596  ax-resscn 10597  ax-1cn 10598  ax-icn 10599  ax-addcl 10600  ax-addrcl 10601  ax-mulcl 10602  ax-mulrcl 10603  ax-mulcom 10604  ax-addass 10605  ax-mulass 10606  ax-distr 10607  ax-i2m1 10608  ax-1ne0 10609  ax-1rid 10610  ax-rnegex 10611  ax-rrecex 10612  ax-cnre 10613  ax-pre-lttri 10614  ax-pre-lttrn 10615  ax-pre-ltadd 10616  ax-pre-mulgt0 10617

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-nel 3127  df-ral 3146  df-rex 3147  df-reu 3148  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-we 5519  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-pred 6151  df-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-riota 7117  df-ov 7162  df-oprab 7163  df-mpo 7164  df-om 7584  df-1st 7692  df-2nd 7693  df-wrecs 7950  df-recs 8011  df-rdg 8049  df-er 8292  df-en 8513  df-dom 8514  df-sdom 8515  df-pnf 10680  df-mnf 10681  df-xr 10682  df-ltxr 10683  df-le 10684  df-sub 10875  df-neg 10876  df-nn 11642  df-n0 11901  df-z 11985  df-uz 12247  df-fz 12896

This theorem is referenced by:  iccpartiltu  43589  iccpartigtl  43590  iccpartgt  43594