Theorem monoord2 10923

Description: Ordering relation for a monotonic sequence, decreasing case. (Contributed by Mario Carneiro, 18-Jul-2014.)

Hypotheses

Ref	Expression
monoord2.1	|- ( ph -> N e. ( ZZ>= ` M ) )
monoord2.2	|- ( ( ph /\ k e. ( M ... N ) ) -> ( F ` k ) e. RR )
monoord2.3	|- ( ( ph /\ k e. ( M ... ( N - 1 ) ) ) -> ( F ` ( k + 1 ) ) <_ ( F ` k ) )

Assertion

Ref	Expression
monoord2	|- ( ph -> ( F ` N ) <_ ( F ` M ) )

Distinct variable groups:   k, F   k, M   k, N   ph, k

Proof of Theorem monoord2

Dummy variable n is distinct from all other variables.

Step	Hyp	Ref	Expression
1		monoord2.1	. . . 4 |- ( ph -> N e. ( ZZ>= ` M ) )
2		monoord2.2	. . . . . . 7 |- ( ( ph /\ k e. ( M ... N ) ) -> ( F ` k ) e. RR )
3	2	renegcld 8707	. . . . . 6 |- ( ( ph /\ k e. ( M ... N ) ) -> -u ( F ` k ) e. RR )
4		eqid 2238	. . . . . 6 |- ( k e. ( M ... N ) |-> -u ( F ` k ) ) = ( k e. ( M ... N ) |-> -u ( F ` k ) )
5	3, 4	fmptd 5862	. . . . 5 |- ( ph -> ( k e. ( M ... N ) |-> -u ( F ` k ) ) : ( M ... N ) --> RR )
6	5	ffvelcdmda 5843	. . . 4 |- ( ( ph /\ n e. ( M ... N ) ) -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` n ) e. RR )
7		monoord2.3	. . . . . . . . 9 |- ( ( ph /\ k e. ( M ... ( N - 1 ) ) ) -> ( F ` ( k + 1 ) ) <_ ( F ` k ) )
8	7	ralrimiva 2623	. . . . . . . 8 |- ( ph -> A. k e. ( M ... ( N - 1 ) ) ( F ` ( k + 1 ) ) <_ ( F ` k ) )
9		oveq1 6092	. . . . . . . . . . 11 |- ( k = n -> ( k + 1 ) = ( n + 1 ) )
10	9	fveq2d 5699	. . . . . . . . . 10 |- ( k = n -> ( F ` ( k + 1 ) ) = ( F ` ( n + 1 ) ) )
11		fveq2 5695	. . . . . . . . . 10 |- ( k = n -> ( F ` k ) = ( F ` n ) )
12	10, 11	breq12d 4143	. . . . . . . . 9 |- ( k = n -> ( ( F ` ( k + 1 ) ) <_ ( F ` k ) <-> ( F ` ( n + 1 ) ) <_ ( F ` n ) ) )
13	12	cbvralv 2786	. . . . . . . 8 |- ( A. k e. ( M ... ( N - 1 ) ) ( F ` ( k + 1 ) ) <_ ( F ` k ) <-> A. n e. ( M ... ( N - 1 ) ) ( F ` ( n + 1 ) ) <_ ( F ` n ) )
14	8, 13	sylib 122	. . . . . . 7 |- ( ph -> A. n e. ( M ... ( N - 1 ) ) ( F ` ( n + 1 ) ) <_ ( F ` n ) )
15	14	r19.21bi 2638	. . . . . 6 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> ( F ` ( n + 1 ) ) <_ ( F ` n ) )
16		fveq2 5695	. . . . . . . . 9 |- ( k = ( n + 1 ) -> ( F ` k ) = ( F ` ( n + 1 ) ) )
17	16	eleq1d 2307	. . . . . . . 8 |- ( k = ( n + 1 ) -> ( ( F ` k ) e. RR <-> ( F ` ( n + 1 ) ) e. RR ) )
18	2	ralrimiva 2623	. . . . . . . . 9 |- ( ph -> A. k e. ( M ... N ) ( F ` k ) e. RR )
19	18	adantr 276	. . . . . . . 8 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> A. k e. ( M ... N ) ( F ` k ) e. RR )
20		fzp1elp1 10482	. . . . . . . . . 10 |- ( n e. ( M ... ( N - 1 ) ) -> ( n + 1 ) e. ( M ... ( ( N - 1 ) + 1 ) ) )
21	20	adantl 277	. . . . . . . . 9 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> ( n + 1 ) e. ( M ... ( ( N - 1 ) + 1 ) ) )
22		eluzelz 9931	. . . . . . . . . . . . . 14 |- ( N e. ( ZZ>= ` M ) -> N e. ZZ )
23	1, 22	syl 14	. . . . . . . . . . . . 13 |- ( ph -> N e. ZZ )
24	23	zcnd 9769	. . . . . . . . . . . 12 |- ( ph -> N e. CC )
25		ax-1cn 8272	. . . . . . . . . . . 12 |- 1 e. CC
26		npcan 8535	. . . . . . . . . . . 12 |- ( ( N e. CC /\ 1 e. CC ) -> ( ( N - 1 ) + 1 ) = N )
27	24, 25, 26	sylancl 417	. . . . . . . . . . 11 |- ( ph -> ( ( N - 1 ) + 1 ) = N )
28	27	oveq2d 6101	. . . . . . . . . 10 |- ( ph -> ( M ... ( ( N - 1 ) + 1 ) ) = ( M ... N ) )
29	28	adantr 276	. . . . . . . . 9 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> ( M ... ( ( N - 1 ) + 1 ) ) = ( M ... N ) )
30	21, 29	eleqtrd 2317	. . . . . . . 8 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> ( n + 1 ) e. ( M ... N ) )
31	17, 19, 30	rspcdva 2934	. . . . . . 7 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> ( F ` ( n + 1 ) ) e. RR )
32	11	eleq1d 2307	. . . . . . . 8 |- ( k = n -> ( ( F ` k ) e. RR <-> ( F ` n ) e. RR ) )
33		fzssp1 10473	. . . . . . . . . 10 |- ( M ... ( N - 1 ) ) C_ ( M ... ( ( N - 1 ) + 1 ) )
34	33, 28	sseqtrid 3298	. . . . . . . . 9 |- ( ph -> ( M ... ( N - 1 ) ) C_ ( M ... N ) )
35	34	sselda 3248	. . . . . . . 8 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> n e. ( M ... N ) )
36	32, 19, 35	rspcdva 2934	. . . . . . 7 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> ( F ` n ) e. RR )
37	31, 36	lenegd 8852	. . . . . 6 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> ( ( F ` ( n + 1 ) ) <_ ( F ` n ) <-> -u ( F ` n ) <_ -u ( F ` ( n + 1 ) ) ) )
38	15, 37	mpbid 147	. . . . 5 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> -u ( F ` n ) <_ -u ( F ` ( n + 1 ) ) )
39	36	renegcld 8707	. . . . . 6 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> -u ( F ` n ) e. RR )
40	11	negeqd 8521	. . . . . . 7 |- ( k = n -> -u ( F ` k ) = -u ( F ` n ) )
41	40, 4	fvmptg 5781	. . . . . 6 |- ( ( n e. ( M ... N ) /\ -u ( F ` n ) e. RR ) -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` n ) = -u ( F ` n ) )
42	35, 39, 41	syl2anc 415	. . . . 5 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` n ) = -u ( F ` n ) )
43	31	renegcld 8707	. . . . . 6 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> -u ( F ` ( n + 1 ) ) e. RR )
44	16	negeqd 8521	. . . . . . 7 |- ( k = ( n + 1 ) -> -u ( F ` k ) = -u ( F ` ( n + 1 ) ) )
45	44, 4	fvmptg 5781	. . . . . 6 |- ( ( ( n + 1 ) e. ( M ... N ) /\ -u ( F ` ( n + 1 ) ) e. RR ) -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` ( n + 1 ) ) = -u ( F ` ( n + 1 ) ) )
46	30, 43, 45	syl2anc 415	. . . . 5 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` ( n + 1 ) ) = -u ( F ` ( n + 1 ) ) )
47	38, 42, 46	3brtr4d 4162	. . . 4 |- ( ( ph /\ n e. ( M ... ( N - 1 ) ) ) -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` n ) <_ ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` ( n + 1 ) ) )
48	1, 6, 47	monoord 10922	. . 3 |- ( ph -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` M ) <_ ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` N ) )
49		eluzfz1 10435	. . . . 5 |- ( N e. ( ZZ>= ` M ) -> M e. ( M ... N ) )
50	1, 49	syl 14	. . . 4 |- ( ph -> M e. ( M ... N ) )
51		fveq2 5695	. . . . . . 7 |- ( k = M -> ( F ` k ) = ( F ` M ) )
52	51	eleq1d 2307	. . . . . 6 |- ( k = M -> ( ( F ` k ) e. RR <-> ( F ` M ) e. RR ) )
53	52, 18, 50	rspcdva 2934	. . . . 5 |- ( ph -> ( F ` M ) e. RR )
54	53	renegcld 8707	. . . 4 |- ( ph -> -u ( F ` M ) e. RR )
55	51	negeqd 8521	. . . . 5 |- ( k = M -> -u ( F ` k ) = -u ( F ` M ) )
56	55, 4	fvmptg 5781	. . . 4 |- ( ( M e. ( M ... N ) /\ -u ( F ` M ) e. RR ) -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` M ) = -u ( F ` M ) )
57	50, 54, 56	syl2anc 415	. . 3 |- ( ph -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` M ) = -u ( F ` M ) )
58		eluzfz2 10436	. . . . 5 |- ( N e. ( ZZ>= ` M ) -> N e. ( M ... N ) )
59	1, 58	syl 14	. . . 4 |- ( ph -> N e. ( M ... N ) )
60		fveq2 5695	. . . . . . 7 |- ( k = N -> ( F ` k ) = ( F ` N ) )
61	60	eleq1d 2307	. . . . . 6 |- ( k = N -> ( ( F ` k ) e. RR <-> ( F ` N ) e. RR ) )
62	61, 18, 59	rspcdva 2934	. . . . 5 |- ( ph -> ( F ` N ) e. RR )
63	62	renegcld 8707	. . . 4 |- ( ph -> -u ( F ` N ) e. RR )
64	60	negeqd 8521	. . . . 5 |- ( k = N -> -u ( F ` k ) = -u ( F ` N ) )
65	64, 4	fvmptg 5781	. . . 4 |- ( ( N e. ( M ... N ) /\ -u ( F ` N ) e. RR ) -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` N ) = -u ( F ` N ) )
66	59, 63, 65	syl2anc 415	. . 3 |- ( ph -> ( ( k e. ( M ... N ) |-> -u ( F ` k ) ) ` N ) = -u ( F ` N ) )
67	48, 57, 66	3brtr3d 4161	. 2 |- ( ph -> -u ( F ` M ) <_ -u ( F ` N ) )
68	62, 53	lenegd 8852	. 2 |- ( ph -> ( ( F ` N ) <_ ( F ` M ) <-> -u ( F ` M ) <_ -u ( F ` N ) ) )
69	67, 68	mpbird 167	1 |- ( ph -> ( F ` N ) <_ ( F ` M ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   A.wral 2528   class class class wbr 4130   |-> cmpt 4192   ` cfv 5377  (class class class)co 6085   CCcc 8177   RRcr 8178   1c1 8180   + caddc 8182   <_ cle 8361   - cmin 8497   -ucneg 8498   ZZcz 9644   ZZ>=cuz 9921   ...cfz 10411

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412

This theorem is used by: (None)