c1lip1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > c1lip1		Structured version Visualization version GIF version

Theorem c1lip1 23760

Description: C1 functions are Lipschitz continuous on closed intervals. (Contributed by Stefan O'Rear, 16-Nov-2014.)

**Hypotheses**
Ref	Expression
c1lip1.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
c1lip1.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
c1lip1.f	⊢ (𝜑 → 𝐹 ∈ (ℂ ↑_pm ℝ))
c1lip1.dv	⊢ (𝜑 → ((ℝ D 𝐹) ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
c1lip1.cn	⊢ (𝜑 → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))

**Assertion**
Ref	Expression
c1lip1	⊢ (𝜑 → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))

Distinct variable groups: 𝜑,𝑥,𝑦,𝑘 𝑥,𝐴,𝑦,𝑘 𝑥,𝐵,𝑦,𝑘 𝑥,𝐹,𝑦,𝑘

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

Step	Hyp	Ref	Expression
1		0re 10040	. . . 4 ⊢ 0 ∈ ℝ
2	1	ne0ii 3923	. . 3 ⊢ ℝ ≠ ∅
3		ral0 4076	. . . . 5 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))
4		c1lip1.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ)
5	4	rexrd 10089	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
6		c1lip1.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ)
7	6	rexrd 10089	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
8		icc0 12223	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴))
9	5, 7, 8	syl2anc 693	. . . . . . 7 ⊢ (𝜑 → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴))
10	9	biimpar 502	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (𝐴[,]𝐵) = ∅)
11	10	raleqdv 3144	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))) ↔ ∀𝑥 ∈ ∅ ∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
12	3, 11	mpbiri 248	. . . 4 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
13	12	ralrimivw 2967	. . 3 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ∀𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
14		r19.2z 4060	. . 3 ⊢ ((ℝ ≠ ∅ ∧ ∀𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
15	2, 13, 14	sylancr 695	. 2 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
16	4	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ)
17	6	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ)
18		simpr 477	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵)
19		c1lip1.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑_pm ℝ))
20	19	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐹 ∈ (ℂ ↑_pm ℝ))
21		c1lip1.dv	. . . . . 6 ⊢ (𝜑 → ((ℝ D 𝐹) ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
22	21	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
23		c1lip1.cn	. . . . . 6 ⊢ (𝜑 → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
24	23	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
25		eqid 2622	. . . . 5 ⊢ sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < )
26	16, 17, 18, 20, 22, 24, 25	c1liplem1 23759	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) ∈ ℝ ∧ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))))
27		oveq1 6657	. . . . . . . 8 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → (𝑘 · (abs‘(𝑏 − 𝑎))) = (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))
28	27	breq2d 4665	. . . . . . 7 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎))) ↔ (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎)))))
29	28	imbi2d 330	. . . . . 6 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → ((𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ (𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))))
30	29	2ralbidv 2989	. . . . 5 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))))
31	30	rspcev 3309	. . . 4 ⊢ ((sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) ∈ ℝ ∧ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))) → ∃𝑘 ∈ ℝ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))))
32	26, 31	syl 17	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∃𝑘 ∈ ℝ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))))
33		breq1 4656	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → (𝑎 < 𝑏 ↔ 𝑥 < 𝑏))
34		fveq2 6191	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → (𝐹‘𝑎) = (𝐹‘𝑥))
35	34	oveq2d 6666	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → ((𝐹‘𝑏) − (𝐹‘𝑎)) = ((𝐹‘𝑏) − (𝐹‘𝑥)))
36	35	fveq2d 6195	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) = (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))))
37		oveq2 6658	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → (𝑏 − 𝑎) = (𝑏 − 𝑥))
38	37	fveq2d 6195	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → (abs‘(𝑏 − 𝑎)) = (abs‘(𝑏 − 𝑥)))
39	38	oveq2d 6666	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑘 · (abs‘(𝑏 − 𝑎))) = (𝑘 · (abs‘(𝑏 − 𝑥))))
40	36, 39	breq12d 4666	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎))) ↔ (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥)))))
41	33, 40	imbi12d 334	. . . . . . . . 9 ⊢ (𝑎 = 𝑥 → ((𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ (𝑥 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥))))))
42		breq2 4657	. . . . . . . . . 10 ⊢ (𝑏 = 𝑦 → (𝑥 < 𝑏 ↔ 𝑥 < 𝑦))
43		fveq2 6191	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑦 → (𝐹‘𝑏) = (𝐹‘𝑦))
44	43	oveq1d 6665	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑦 → ((𝐹‘𝑏) − (𝐹‘𝑥)) = ((𝐹‘𝑦) − (𝐹‘𝑥)))
45	44	fveq2d 6195	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑦 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
46		oveq1 6657	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑦 → (𝑏 − 𝑥) = (𝑦 − 𝑥))
47	46	fveq2d 6195	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑦 → (abs‘(𝑏 − 𝑥)) = (abs‘(𝑦 − 𝑥)))
48	47	oveq2d 6666	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑦 → (𝑘 · (abs‘(𝑏 − 𝑥))) = (𝑘 · (abs‘(𝑦 − 𝑥))))
49	45, 48	breq12d 4666	. . . . . . . . . 10 ⊢ (𝑏 = 𝑦 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥))) ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
50	42, 49	imbi12d 334	. . . . . . . . 9 ⊢ (𝑏 = 𝑦 → ((𝑥 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥)))) ↔ (𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))))
51	41, 50	rspc2v 3322	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))))
52	51	ad2antlr 763	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 < 𝑦) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))))
53		pm2.27 42	. . . . . . . 8 ⊢ (𝑥 < 𝑦 → ((𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
54	53	adantl 482	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 < 𝑦) → ((𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
55	52, 54	syld 47	. . . . . 6 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 < 𝑦) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
56		0le0 11110	. . . . . . . . . 10 ⊢ 0 ≤ 0
57		fvres 6207	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) = (𝐹‘𝑥))
58	57	ad2antrl 764	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) = (𝐹‘𝑥))
59		cncff 22696	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ) → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ)
60	23, 59	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ)
61	60	ad2antrr 762	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ)
62		simpl 473	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ (𝐴[,]𝐵))
63		ffvelrn 6357	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) ∈ ℝ)
64	61, 62, 63	syl2an 494	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) ∈ ℝ)
65	58, 64	eqeltrrd 2702	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑥) ∈ ℝ)
66	65	recnd 10068	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑥) ∈ ℂ)
67	66	subidd 10380	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹‘𝑥) − (𝐹‘𝑥)) = 0)
68	67	abs00bd 14031	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) = 0)
69		iccssre 12255	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
70	4, 6, 69	syl2anc 693	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
71	70	ad3antrrr 766	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐴[,]𝐵) ⊆ ℝ)
72		simprl 794	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑥 ∈ (𝐴[,]𝐵))
73	71, 72	sseldd 3604	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑥 ∈ ℝ)
74	73	recnd 10068	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑥 ∈ ℂ)
75	74	subidd 10380	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 − 𝑥) = 0)
76	75	abs00bd 14031	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘(𝑥 − 𝑥)) = 0)
77	76	oveq2d 6666	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑘 · (abs‘(𝑥 − 𝑥))) = (𝑘 · 0))
78		simplr 792	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑘 ∈ ℝ)
79	78	recnd 10068	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑘 ∈ ℂ)
80	79	mul01d 10235	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑘 · 0) = 0)
81	77, 80	eqtrd 2656	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑘 · (abs‘(𝑥 − 𝑥))) = 0)
82	68, 81	breq12d 4666	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑥 − 𝑥))) ↔ 0 ≤ 0))
83	56, 82	mpbiri 248	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑥 − 𝑥))))
84		fveq2 6191	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
85	84	oveq1d 6665	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) − (𝐹‘𝑥)) = ((𝐹‘𝑦) − (𝐹‘𝑥)))
86	85	fveq2d 6195	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
87		oveq1 6657	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → (𝑥 − 𝑥) = (𝑦 − 𝑥))
88	87	fveq2d 6195	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (abs‘(𝑥 − 𝑥)) = (abs‘(𝑦 − 𝑥)))
89	88	oveq2d 6666	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑘 · (abs‘(𝑥 − 𝑥))) = (𝑘 · (abs‘(𝑦 − 𝑥))))
90	86, 89	breq12d 4666	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑥 − 𝑥))) ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
91	83, 90	syl5ibcom 235	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 = 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
92	91	imp 445	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 = 𝑦) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
93	92	a1d 25	. . . . . 6 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 = 𝑦) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
94		breq1 4656	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑦 → (𝑎 < 𝑏 ↔ 𝑦 < 𝑏))
95		fveq2 6191	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑦 → (𝐹‘𝑎) = (𝐹‘𝑦))
96	95	oveq2d 6666	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑦 → ((𝐹‘𝑏) − (𝐹‘𝑎)) = ((𝐹‘𝑏) − (𝐹‘𝑦)))
97	96	fveq2d 6195	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑦 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) = (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))))
98		oveq2 6658	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑦 → (𝑏 − 𝑎) = (𝑏 − 𝑦))
99	98	fveq2d 6195	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑦 → (abs‘(𝑏 − 𝑎)) = (abs‘(𝑏 − 𝑦)))
100	99	oveq2d 6666	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑦 → (𝑘 · (abs‘(𝑏 − 𝑎))) = (𝑘 · (abs‘(𝑏 − 𝑦))))
101	97, 100	breq12d 4666	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑦 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎))) ↔ (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦)))))
102	94, 101	imbi12d 334	. . . . . . . . . 10 ⊢ (𝑎 = 𝑦 → ((𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ (𝑦 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦))))))
103		breq2 4657	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑥 → (𝑦 < 𝑏 ↔ 𝑦 < 𝑥))
104		fveq2 6191	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 𝑥 → (𝐹‘𝑏) = (𝐹‘𝑥))
105	104	oveq1d 6665	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑥 → ((𝐹‘𝑏) − (𝐹‘𝑦)) = ((𝐹‘𝑥) − (𝐹‘𝑦)))
106	105	fveq2d 6195	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑥 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) = (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))))
107		oveq1 6657	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 𝑥 → (𝑏 − 𝑦) = (𝑥 − 𝑦))
108	107	fveq2d 6195	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑥 → (abs‘(𝑏 − 𝑦)) = (abs‘(𝑥 − 𝑦)))
109	108	oveq2d 6666	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑥 → (𝑘 · (abs‘(𝑏 − 𝑦))) = (𝑘 · (abs‘(𝑥 − 𝑦))))
110	106, 109	breq12d 4666	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑥 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦))) ↔ (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦)))))
111	103, 110	imbi12d 334	. . . . . . . . . 10 ⊢ (𝑏 = 𝑥 → ((𝑦 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦)))) ↔ (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
112	102, 111	rspc2v 3322	. . . . . . . . 9 ⊢ ((𝑦 ∈ (𝐴[,]𝐵) ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
113	112	ancoms 469	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
114	113	ad2antlr 763	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
115		simpr 477	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → 𝑦 < 𝑥)
116		fvres 6207	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) = (𝐹‘𝑦))
117	116	ad2antll 765	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) = (𝐹‘𝑦))
118		simpr 477	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑦 ∈ (𝐴[,]𝐵))
119		ffvelrn 6357	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ ∧ 𝑦 ∈ (𝐴[,]𝐵)) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) ∈ ℝ)
120	61, 118, 119	syl2an 494	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) ∈ ℝ)
121	117, 120	eqeltrrd 2702	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑦) ∈ ℝ)
122	121	recnd 10068	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑦) ∈ ℂ)
123	66, 122	abssubd 14192	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
124	123	adantr 481	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
125	70	ad2antrr 762	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
126	125	sseld 3602	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝑥 ∈ (𝐴[,]𝐵) → 𝑥 ∈ ℝ))
127	125	sseld 3602	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝑦 ∈ (𝐴[,]𝐵) → 𝑦 ∈ ℝ))
128	126, 127	anim12d 586	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)))
129	128	imp 445	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ))
130		recn 10026	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ)
131		recn 10026	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ)
132		abssub 14066	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
133	130, 131, 132	syl2an 494	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
134	129, 133	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
135	134	adantr 481	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
136	135	oveq2d 6666	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (𝑘 · (abs‘(𝑥 − 𝑦))) = (𝑘 · (abs‘(𝑦 − 𝑥))))
137	124, 136	breq12d 4666	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))) ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
138	137	biimpd 219	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
139	115, 138	embantd 59	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → ((𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
140	114, 139	syld 47	. . . . . 6 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
141		lttri4 10122	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
142	129, 141	syl 17	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
143	55, 93, 140, 142	mpjao3dan 1395	. . . . 5 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
144	143	ralrimdvva 2974	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
145	144	reximdva 3017	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (∃𝑘 ∈ ℝ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
146	32, 145	mpd 15	. 2 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
147	15, 146, 6, 4	ltlecasei 10145	1 ⊢ (𝜑 → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∨ w3o 1036 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 ∃wrex 2913 ⊆ wss 3574 ∅c0 3915 class class class wbr 4653 ↾ cres 5116 “ cima 5117 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ↑_pm cpm 7858 supcsup 8346 ℂcc 9934 ℝcr 9935 0cc0 9936 · cmul 9941 ℝ^*cxr 10073 < clt 10074 ≤ cle 10075 − cmin 10266 [,]cicc 12178 abscabs 13974 –cn→ccncf 22679 D cdv 23627

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 ax-addf 10015 ax-mulf 10016

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-of 6897 df-om 7066 df-1st 7168 df-2nd 7169 df-supp 7296 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-2o 7561 df-oadd 7564 df-er 7742 df-map 7859 df-pm 7860 df-ixp 7909 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-fsupp 8276 df-fi 8317 df-sup 8348 df-inf 8349 df-oi 8415 df-card 8765 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-q 11789 df-rp 11833 df-xneg 11946 df-xadd 11947 df-xmul 11948 df-ioo 12179 df-ico 12181 df-icc 12182 df-fz 12327 df-fzo 12466 df-seq 12802 df-exp 12861 df-hash 13118 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-plusg 15954 df-mulr 15955 df-starv 15956 df-sca 15957 df-vsca 15958 df-ip 15959 df-tset 15960 df-ple 15961 df-ds 15964 df-unif 15965 df-hom 15966 df-cco 15967 df-rest 16083 df-topn 16084 df-0g 16102 df-gsum 16103 df-topgen 16104 df-pt 16105 df-prds 16108 df-xrs 16162 df-qtop 16167 df-imas 16168 df-xps 16170 df-mre 16246 df-mrc 16247 df-acs 16249 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-submnd 17336 df-mulg 17541 df-cntz 17750 df-cmn 18195 df-psmet 19738 df-xmet 19739 df-met 19740 df-bl 19741 df-mopn 19742 df-fbas 19743 df-fg 19744 df-cnfld 19747 df-top 20699 df-topon 20716 df-topsp 20737 df-bases 20750 df-cld 20823 df-ntr 20824 df-cls 20825 df-nei 20902 df-lp 20940 df-perf 20941 df-cn 21031 df-cnp 21032 df-haus 21119 df-cmp 21190 df-tx 21365 df-hmeo 21558 df-fil 21650 df-fm 21742 df-flim 21743 df-flf 21744 df-xms 22125 df-ms 22126 df-tms 22127 df-cncf 22681 df-limc 23630 df-dv 23631

This theorem is referenced by: c1lip2 23761

W3C validator