Theorem smonoord 48174

Description: Ordering relation for a strictly monotonic sequence, increasing case. Analogous to monoord 14088 (except that the case 𝑀 = 𝑁 must be excluded). Duplicate of monoords 46076? (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 13578	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑁 ∈ ((𝑀 + 1)...𝑁))
3	1, 2	syl 18	. 2 ⊢ (𝜑 → 𝑁 ∈ ((𝑀 + 1)...𝑁))
4		eleq1 2853	. . . . . 6 ⊢ (𝑥 = (𝑀 + 1) → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ (𝑀 + 1) ∈ ((𝑀 + 1)...𝑁)))
5		fveq2 6885	. . . . . . 7 ⊢ (𝑥 = (𝑀 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑀 + 1)))
6	5	breq2d 5123	. . . . . 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 2853	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ 𝑛 ∈ ((𝑀 + 1)...𝑁)))
10		fveq2 6885	. . . . . . 7 ⊢ (𝑥 = 𝑛 → (𝐹‘𝑥) = (𝐹‘𝑛))
11	10	breq2d 5123	. . . . . 6 ⊢ (𝑥 = 𝑛 → ((𝐹‘𝑀) < (𝐹‘𝑥) ↔ (𝐹‘𝑀) < (𝐹‘𝑛)))
12	9, 11	imbi12d 347	. . . . 5 ⊢ (𝑥 = 𝑛 → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥)) ↔ (𝑛 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑛))))
13	12	imbi2d 343	. . . 4 ⊢ (𝑥 = 𝑛 → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥))) ↔ (𝜑 → (𝑛 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑛)))))
14		eleq1 2853	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)))
15		fveq2 6885	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑛 + 1)))
16	15	breq2d 5123	. . . . . 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 2853	. . . . . 6 ⊢ (𝑥 = 𝑁 → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ 𝑁 ∈ ((𝑀 + 1)...𝑁)))
20		fveq2 6885	. . . . . . 7 ⊢ (𝑥 = 𝑁 → (𝐹‘𝑥) = (𝐹‘𝑁))
21	20	breq2d 5123	. . . . . 6 ⊢ (𝑥 = 𝑁 → ((𝐹‘𝑀) < (𝐹‘𝑥) ↔ (𝐹‘𝑀) < (𝐹‘𝑁)))
22	19, 21	imbi12d 347	. . . . 5 ⊢ (𝑥 = 𝑁 → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥)) ↔ (𝑁 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑁))))
23	22	imbi2d 343	. . . 4 ⊢ (𝑥 = 𝑁 → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑥))) ↔ (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑁)))))
24		smonoord.0	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ)
25		eluzp1m1 12906	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑀 + 1))) → (𝑁 − 1) ∈ (ℤ≥‘𝑀))
26	24, 1, 25	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 1) ∈ (ℤ≥‘𝑀))
27		eluzfz1 13577	. . . . . . . 8 ⊢ ((𝑁 − 1) ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...(𝑁 − 1)))
28	26, 27	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ (𝑀...(𝑁 − 1)))
29		smonoord.3	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 − 1))) → (𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))
30	29	ralrimiva 3159	. . . . . . 7 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...(𝑁 − 1))(𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))
31		fveq2 6885	. . . . . . . . 9 ⊢ (𝑘 = 𝑀 → (𝐹‘𝑘) = (𝐹‘𝑀))
32		fvoveq1 7442	. . . . . . . . 9 ⊢ (𝑘 = 𝑀 → (𝐹‘(𝑘 + 1)) = (𝐹‘(𝑀 + 1)))
33	31, 32	breq12d 5124	. . . . . . . 8 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) < (𝐹‘(𝑘 + 1)) ↔ (𝐹‘𝑀) < (𝐹‘(𝑀 + 1))))
34	33	rspcv 3579	. . . . . . 7 ⊢ (𝑀 ∈ (𝑀...(𝑁 − 1)) → (∀𝑘 ∈ (𝑀...(𝑁 − 1))(𝐹‘𝑘) < (𝐹‘(𝑘 + 1)) → (𝐹‘𝑀) < (𝐹‘(𝑀 + 1))))
35	28, 30, 34	sylc 66	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝑀) < (𝐹‘(𝑀 + 1)))
36	35	a1d 26	. . . . 5 ⊢ (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘(𝑀 + 1))))
37	36	a1i 11	. . . 4 ⊢ ((𝑀 + 1) ∈ ℤ → (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘(𝑀 + 1)))))
38		peano2fzr 13583	. . . . . . . 8 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → 𝑛 ∈ ((𝑀 + 1)...𝑁))
39	38	adantll 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → 𝑛 ∈ ((𝑀 + 1)...𝑁))
40	39	ex 418	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → 𝑛 ∈ ((𝑀 + 1)...𝑁)))
41	40	imim1d 83	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) → ((𝑛 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑛)) → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑛))))
42		peano2uzr 12945	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑛 ∈ (ℤ≥‘𝑀))
43	42	ex 418	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑛 ∈ (ℤ≥‘𝑀)))
44	43, 24	syl11 34	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → (𝜑 → 𝑛 ∈ (ℤ≥‘𝑀)))
45	44	adantr 486	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → (𝜑 → 𝑛 ∈ (ℤ≥‘𝑀)))
46	45	impcom 413	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (ℤ≥‘𝑀))
47		eluzelz 12890	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑛 ∈ ℤ)
48	47	adantr 486	. . . . . . . . . 10 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → 𝑛 ∈ ℤ)
49	48	adantl 487	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ ℤ)
50		elfzuz3 13567	. . . . . . . . . 10 ⊢ ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → 𝑁 ∈ (ℤ≥‘(𝑛 + 1)))
51	50	ad2antll 742	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑁 ∈ (ℤ≥‘(𝑛 + 1)))
52		eluzp1m1 12906	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑁 − 1) ∈ (ℤ≥‘𝑛))
53	49, 51, 52	syl2anc 596	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑁 − 1) ∈ (ℤ≥‘𝑛))
54		elfzuzb 13564	. . . . . . . 8 ⊢ (𝑛 ∈ (𝑀...(𝑁 − 1)) ↔ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑁 − 1) ∈ (ℤ≥‘𝑛)))
55	46, 53, 54	sylanbrc 595	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (𝑀...(𝑁 − 1)))
56	30	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ∀𝑘 ∈ (𝑀...(𝑁 − 1))(𝐹‘𝑘) < (𝐹‘(𝑘 + 1)))
57		fveq2 6885	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → (𝐹‘𝑘) = (𝐹‘𝑛))
58		fvoveq1 7442	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → (𝐹‘(𝑘 + 1)) = (𝐹‘(𝑛 + 1)))
59	57, 58	breq12d 5124	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → ((𝐹‘𝑘) < (𝐹‘(𝑘 + 1)) ↔ (𝐹‘𝑛) < (𝐹‘(𝑛 + 1))))
60	59	rspcv 3579	. . . . . . 7 ⊢ (𝑛 ∈ (𝑀...(𝑁 − 1)) → (∀𝑘 ∈ (𝑀...(𝑁 − 1))(𝐹‘𝑘) < (𝐹‘(𝑘 + 1)) → (𝐹‘𝑛) < (𝐹‘(𝑛 + 1))))
61	55, 56, 60	sylc 66	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘𝑛) < (𝐹‘(𝑛 + 1)))
62		zre 12612	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
63	62	lep1d 12163	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ ℤ → 𝑀 ≤ (𝑀 + 1))
64	24, 63	jccir 531	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑀 ∈ ℤ ∧ 𝑀 ≤ (𝑀 + 1)))
65		eluzuzle 12889	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≤ (𝑀 + 1)) → (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑁 ∈ (ℤ≥‘𝑀)))
66	64, 1, 65	sylc 66	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
67		eluzfz1 13577	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
68	66, 67	syl 18	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁))
69		smonoord.2	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ)
70	69	ralrimiva 3159	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ ℝ)
71	31	eleq1d 2850	. . . . . . . . . 10 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑀) ∈ ℝ))
72	71	rspcv 3579	. . . . . . . . 9 ⊢ (𝑀 ∈ (𝑀...𝑁) → (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ ℝ → (𝐹‘𝑀) ∈ ℝ))
73	68, 70, 72	sylc 66	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘𝑀) ∈ ℝ)
74	73	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘𝑀) ∈ ℝ)
75		fzp1ss 13622	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℤ → ((𝑀 + 1)...𝑁) ⊆ (𝑀...𝑁))
76	24, 75	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑀 + 1)...𝑁) ⊆ (𝑀...𝑁))
77	76	sseld 3937	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝑛 + 1) ∈ (𝑀...𝑁)))
78	77	com12 33	. . . . . . . . . . 11 ⊢ ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝜑 → (𝑛 + 1) ∈ (𝑀...𝑁)))
79	78	adantl 487	. . . . . . . . . 10 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → (𝜑 → (𝑛 + 1) ∈ (𝑀...𝑁)))
80	79	impcom 413	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑛 + 1) ∈ (𝑀...𝑁))
81		peano2fzr 13583	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝑛 ∈ (𝑀...𝑁))
82	46, 80, 81	syl2anc 596	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (𝑀...𝑁))
83	70	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ ℝ)
84	57	eleq1d 2850	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑛) ∈ ℝ))
85	84	rspcv 3579	. . . . . . . 8 ⊢ (𝑛 ∈ (𝑀...𝑁) → (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ ℝ → (𝐹‘𝑛) ∈ ℝ))
86	82, 83, 85	sylc 66	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘𝑛) ∈ ℝ)
87		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑘 = (𝑛 + 1) → (𝐹‘𝑘) = (𝐹‘(𝑛 + 1)))
88	87	eleq1d 2850	. . . . . . . . 9 ⊢ (𝑘 = (𝑛 + 1) → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘(𝑛 + 1)) ∈ ℝ))
89	88	rspcv 3579	. . . . . . . 8 ⊢ ((𝑛 + 1) ∈ (𝑀...𝑁) → (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ ℝ → (𝐹‘(𝑛 + 1)) ∈ ℝ))
90	80, 83, 89	sylc 66	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘(𝑛 + 1)) ∈ ℝ)
91		lttr 11303	. . . . . . 7 ⊢ (((𝐹‘𝑀) ∈ ℝ ∧ (𝐹‘𝑛) ∈ ℝ ∧ (𝐹‘(𝑛 + 1)) ∈ ℝ) → (((𝐹‘𝑀) < (𝐹‘𝑛) ∧ (𝐹‘𝑛) < (𝐹‘(𝑛 + 1))) → (𝐹‘𝑀) < (𝐹‘(𝑛 + 1))))
92	74, 86, 90, 91	syl3anc 1398	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (((𝐹‘𝑀) < (𝐹‘𝑛) ∧ (𝐹‘𝑛) < (𝐹‘(𝑛 + 1))) → (𝐹‘𝑀) < (𝐹‘(𝑛 + 1))))
93	61, 92	mpan2d 707	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((𝐹‘𝑀) < (𝐹‘𝑛) → (𝐹‘𝑀) < (𝐹‘(𝑛 + 1))))
94	41, 93	animpimp2impd 860	. . . 4 ⊢ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → ((𝜑 → (𝑛 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑛))) → (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘(𝑛 + 1))))))
95	8, 13, 18, 23, 37, 94	uzind4 12948	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑁))))
96	1, 95	mpcom 39	. 2 ⊢ (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (𝐹‘𝑀) < (𝐹‘𝑁)))
97	3, 96	mpd 16	1 ⊢ (𝜑 → (𝐹‘𝑀) < (𝐹‘𝑁))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081   ⊆ wss 3906   class class class wbr 5111  ‘cfv 6540  (class class class)co 7419  ℝcr 11116  1c1 11118   + caddc 11120   < clt 11260   ≤ cle 11261   − cmin 11458  ℤcz 12608  ℤ_≥cuz 12880  ...cfz 13553

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11173  ax-resscn 11174  ax-1cn 11175  ax-icn 11176  ax-addcl 11177  ax-addrcl 11178  ax-mulcl 11179  ax-mulrcl 11180  ax-mulcom 11181  ax-addass 11182  ax-mulass 11183  ax-distr 11184  ax-i2m1 11185  ax-1ne0 11186  ax-1rid 11187  ax-rnegex 11188  ax-rrecex 11189  ax-cnre 11190  ax-pre-lttri 11191  ax-pre-lttrn 11192  ax-pre-ltadd 11193  ax-pre-mulgt0 11194

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-er 8700  df-en 8950  df-dom 8951  df-sdom 8952  df-pnf 11262  df-mnf 11263  df-xr 11264  df-ltxr 11265  df-le 11266  df-sub 11460  df-neg 11461  df-nn 12251  df-n0 12522  df-z 12609  df-uz 12881  df-fz 13554

This theorem is used by:  iccpartiltu  48231  iccpartigtl  48232  iccpartgt  48236