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 25066

Description: C^1 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 10908	. . . 4 ⊢ 0 ∈ ℝ
2	1	ne0ii 4268	. . 3 ⊢ ℝ ≠ ∅
3		ral0 4440	. . . . 5 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))
4		c1lip1.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ)
5	4	rexrd 10956	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
6		c1lip1.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ)
7	6	rexrd 10956	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
8		icc0 13056	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴))
9	5, 7, 8	syl2anc 583	. . . . . . 7 ⊢ (𝜑 → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴))
10	9	biimpar 477	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (𝐴[,]𝐵) = ∅)
11	10	raleqdv 3339	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))) ↔ ∀𝑥 ∈ ∅ ∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
12	3, 11	mpbiri 257	. . . 4 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
13	12	ralrimivw 3108	. . 3 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ∀𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
14		r19.2z 4422	. . 3 ⊢ ((ℝ ≠ ∅ ∧ ∀𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
15	2, 13, 14	sylancr 586	. 2 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
16	4	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ)
17	6	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ)
18		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵)
19		c1lip1.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑_pm ℝ))
20	19	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐹 ∈ (ℂ ↑_pm ℝ))
21		c1lip1.dv	. . . . . 6 ⊢ (𝜑 → ((ℝ D 𝐹) ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
22	21	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
23		c1lip1.cn	. . . . . 6 ⊢ (𝜑 → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
24	23	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
25		eqid 2738	. . . . 5 ⊢ sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < )
26	16, 17, 18, 20, 22, 24, 25	c1liplem1 25065	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) ∈ ℝ ∧ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))))
27		oveq1 7262	. . . . . . . 8 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → (𝑘 · (abs‘(𝑏 − 𝑎))) = (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))
28	27	breq2d 5082	. . . . . . 7 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎))) ↔ (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎)))))
29	28	imbi2d 340	. . . . . 6 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → ((𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ (𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))))
30	29	2ralbidv 3122	. . . . 5 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))))
31	30	rspcev 3552	. . . 4 ⊢ ((sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) ∈ ℝ ∧ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))) → ∃𝑘 ∈ ℝ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))))
32	26, 31	syl 17	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∃𝑘 ∈ ℝ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))))
33		breq1 5073	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → (𝑎 < 𝑏 ↔ 𝑥 < 𝑏))
34		fveq2 6756	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → (𝐹‘𝑎) = (𝐹‘𝑥))
35	34	oveq2d 7271	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → ((𝐹‘𝑏) − (𝐹‘𝑎)) = ((𝐹‘𝑏) − (𝐹‘𝑥)))
36	35	fveq2d 6760	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) = (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))))
37		oveq2 7263	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → (𝑏 − 𝑎) = (𝑏 − 𝑥))
38	37	fveq2d 6760	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → (abs‘(𝑏 − 𝑎)) = (abs‘(𝑏 − 𝑥)))
39	38	oveq2d 7271	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑘 · (abs‘(𝑏 − 𝑎))) = (𝑘 · (abs‘(𝑏 − 𝑥))))
40	36, 39	breq12d 5083	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎))) ↔ (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥)))))
41	33, 40	imbi12d 344	. . . . . . . . 9 ⊢ (𝑎 = 𝑥 → ((𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ (𝑥 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥))))))
42		breq2 5074	. . . . . . . . . 10 ⊢ (𝑏 = 𝑦 → (𝑥 < 𝑏 ↔ 𝑥 < 𝑦))
43		fveq2 6756	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑦 → (𝐹‘𝑏) = (𝐹‘𝑦))
44	43	fvoveq1d 7277	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑦 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
45		fvoveq1 7278	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑦 → (abs‘(𝑏 − 𝑥)) = (abs‘(𝑦 − 𝑥)))
46	45	oveq2d 7271	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑦 → (𝑘 · (abs‘(𝑏 − 𝑥))) = (𝑘 · (abs‘(𝑦 − 𝑥))))
47	44, 46	breq12d 5083	. . . . . . . . . 10 ⊢ (𝑏 = 𝑦 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥))) ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
48	42, 47	imbi12d 344	. . . . . . . . 9 ⊢ (𝑏 = 𝑦 → ((𝑥 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥)))) ↔ (𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))))
49	41, 48	rspc2v 3562	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))))
50	49	ad2antlr 723	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 < 𝑦) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))))
51		pm2.27 42	. . . . . . . 8 ⊢ (𝑥 < 𝑦 → ((𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
52	51	adantl 481	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 < 𝑦) → ((𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
53	50, 52	syld 47	. . . . . 6 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 < 𝑦) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
54		0le0 12004	. . . . . . . . . 10 ⊢ 0 ≤ 0
55		fvres 6775	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) = (𝐹‘𝑥))
56	55	ad2antrl 724	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) = (𝐹‘𝑥))
57		cncff 23962	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ) → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ)
58	23, 57	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ)
59	58	ad2antrr 722	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ)
60		simpl 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ (𝐴[,]𝐵))
61		ffvelrn 6941	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) ∈ ℝ)
62	59, 60, 61	syl2an 595	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) ∈ ℝ)
63	56, 62	eqeltrrd 2840	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑥) ∈ ℝ)
64	63	recnd 10934	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑥) ∈ ℂ)
65	64	subidd 11250	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹‘𝑥) − (𝐹‘𝑥)) = 0)
66	65	abs00bd 14931	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) = 0)
67		iccssre 13090	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
68	4, 6, 67	syl2anc 583	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
69	68	ad3antrrr 726	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐴[,]𝐵) ⊆ ℝ)
70		simprl 767	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑥 ∈ (𝐴[,]𝐵))
71	69, 70	sseldd 3918	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑥 ∈ ℝ)
72	71	recnd 10934	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑥 ∈ ℂ)
73	72	subidd 11250	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 − 𝑥) = 0)
74	73	abs00bd 14931	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘(𝑥 − 𝑥)) = 0)
75	74	oveq2d 7271	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑘 · (abs‘(𝑥 − 𝑥))) = (𝑘 · 0))
76		simplr 765	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑘 ∈ ℝ)
77	76	recnd 10934	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑘 ∈ ℂ)
78	77	mul01d 11104	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑘 · 0) = 0)
79	75, 78	eqtrd 2778	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑘 · (abs‘(𝑥 − 𝑥))) = 0)
80	66, 79	breq12d 5083	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑥 − 𝑥))) ↔ 0 ≤ 0))
81	54, 80	mpbiri 257	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑥 − 𝑥))))
82		fveq2 6756	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
83	82	fvoveq1d 7277	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
84		fvoveq1 7278	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (abs‘(𝑥 − 𝑥)) = (abs‘(𝑦 − 𝑥)))
85	84	oveq2d 7271	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑘 · (abs‘(𝑥 − 𝑥))) = (𝑘 · (abs‘(𝑦 − 𝑥))))
86	83, 85	breq12d 5083	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑥 − 𝑥))) ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
87	81, 86	syl5ibcom 244	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 = 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
88	87	imp 406	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 = 𝑦) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
89	88	a1d 25	. . . . . 6 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 = 𝑦) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
90		breq1 5073	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑦 → (𝑎 < 𝑏 ↔ 𝑦 < 𝑏))
91		fveq2 6756	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑦 → (𝐹‘𝑎) = (𝐹‘𝑦))
92	91	oveq2d 7271	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑦 → ((𝐹‘𝑏) − (𝐹‘𝑎)) = ((𝐹‘𝑏) − (𝐹‘𝑦)))
93	92	fveq2d 6760	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑦 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) = (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))))
94		oveq2 7263	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑦 → (𝑏 − 𝑎) = (𝑏 − 𝑦))
95	94	fveq2d 6760	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑦 → (abs‘(𝑏 − 𝑎)) = (abs‘(𝑏 − 𝑦)))
96	95	oveq2d 7271	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑦 → (𝑘 · (abs‘(𝑏 − 𝑎))) = (𝑘 · (abs‘(𝑏 − 𝑦))))
97	93, 96	breq12d 5083	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑦 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎))) ↔ (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦)))))
98	90, 97	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑎 = 𝑦 → ((𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ (𝑦 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦))))))
99		breq2 5074	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑥 → (𝑦 < 𝑏 ↔ 𝑦 < 𝑥))
100		fveq2 6756	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑥 → (𝐹‘𝑏) = (𝐹‘𝑥))
101	100	fvoveq1d 7277	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑥 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) = (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))))
102		fvoveq1 7278	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑥 → (abs‘(𝑏 − 𝑦)) = (abs‘(𝑥 − 𝑦)))
103	102	oveq2d 7271	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑥 → (𝑘 · (abs‘(𝑏 − 𝑦))) = (𝑘 · (abs‘(𝑥 − 𝑦))))
104	101, 103	breq12d 5083	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑥 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦))) ↔ (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦)))))
105	99, 104	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑏 = 𝑥 → ((𝑦 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦)))) ↔ (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
106	98, 105	rspc2v 3562	. . . . . . . . 9 ⊢ ((𝑦 ∈ (𝐴[,]𝐵) ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
107	106	ancoms 458	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
108	107	ad2antlr 723	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
109		simpr 484	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → 𝑦 < 𝑥)
110		fvres 6775	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) = (𝐹‘𝑦))
111	110	ad2antll 725	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) = (𝐹‘𝑦))
112		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑦 ∈ (𝐴[,]𝐵))
113		ffvelrn 6941	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ ∧ 𝑦 ∈ (𝐴[,]𝐵)) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) ∈ ℝ)
114	59, 112, 113	syl2an 595	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) ∈ ℝ)
115	111, 114	eqeltrrd 2840	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑦) ∈ ℝ)
116	115	recnd 10934	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑦) ∈ ℂ)
117	64, 116	abssubd 15093	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
118	117	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
119	68	ad2antrr 722	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
120	119	sseld 3916	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝑥 ∈ (𝐴[,]𝐵) → 𝑥 ∈ ℝ))
121	119	sseld 3916	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝑦 ∈ (𝐴[,]𝐵) → 𝑦 ∈ ℝ))
122	120, 121	anim12d 608	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)))
123	122	imp 406	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ))
124		recn 10892	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ)
125		recn 10892	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ)
126		abssub 14966	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
127	124, 125, 126	syl2an 595	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
128	123, 127	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
129	128	adantr 480	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
130	129	oveq2d 7271	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (𝑘 · (abs‘(𝑥 − 𝑦))) = (𝑘 · (abs‘(𝑦 − 𝑥))))
131	118, 130	breq12d 5083	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))) ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
132	131	biimpd 228	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
133	109, 132	embantd 59	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → ((𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
134	108, 133	syld 47	. . . . . 6 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
135		lttri4 10990	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
136	123, 135	syl 17	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
137	53, 89, 134, 136	mpjao3dan 1429	. . . . 5 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
138	137	ralrimdvva 3117	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
139	138	reximdva 3202	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (∃𝑘 ∈ ℝ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
140	32, 139	mpd 15	. 2 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
141	15, 140, 6, 4	ltlecasei 11013	1 ⊢ (𝜑 → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∨ w3o 1084 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∀wral 3063 ∃wrex 3064 ⊆ wss 3883 ∅c0 4253 class class class wbr 5070 ↾ cres 5582 “ cima 5583 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 ↑_pm cpm 8574 supcsup 9129 ℂcc 10800 ℝcr 10801 0cc0 10802 · cmul 10807 ℝ^*cxr 10939 < clt 10940 ≤ cle 10941 − cmin 11135 [,]cicc 13011 abscabs 14873 –cn→ccncf 23945 D cdv 24932

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 ax-addf 10881 ax-mulf 10882

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-iin 4924 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-of 7511 df-om 7688 df-1st 7804 df-2nd 7805 df-supp 7949 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-er 8456 df-map 8575 df-pm 8576 df-ixp 8644 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-fsupp 9059 df-fi 9100 df-sup 9131 df-inf 9132 df-oi 9199 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-uz 12512 df-q 12618 df-rp 12660 df-xneg 12777 df-xadd 12778 df-xmul 12779 df-ioo 13012 df-ico 13014 df-icc 13015 df-fz 13169 df-fzo 13312 df-seq 13650 df-exp 13711 df-hash 13973 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-starv 16903 df-sca 16904 df-vsca 16905 df-ip 16906 df-tset 16907 df-ple 16908 df-ds 16910 df-unif 16911 df-hom 16912 df-cco 16913 df-rest 17050 df-topn 17051 df-0g 17069 df-gsum 17070 df-topgen 17071 df-pt 17072 df-prds 17075 df-xrs 17130 df-qtop 17135 df-imas 17136 df-xps 17138 df-mre 17212 df-mrc 17213 df-acs 17215 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-submnd 18346 df-mulg 18616 df-cntz 18838 df-cmn 19303 df-psmet 20502 df-xmet 20503 df-met 20504 df-bl 20505 df-mopn 20506 df-fbas 20507 df-fg 20508 df-cnfld 20511 df-top 21951 df-topon 21968 df-topsp 21990 df-bases 22004 df-cld 22078 df-ntr 22079 df-cls 22080 df-nei 22157 df-lp 22195 df-perf 22196 df-cn 22286 df-cnp 22287 df-haus 22374 df-cmp 22446 df-tx 22621 df-hmeo 22814 df-fil 22905 df-fm 22997 df-flim 22998 df-flf 22999 df-xms 23381 df-ms 23382 df-tms 23383 df-cncf 23947 df-limc 24935 df-dv 24936

This theorem is referenced by: c1lip2 25067

W3C validator