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 24596

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 10645	. . . 4 ⊢ 0 ∈ ℝ
2	1	ne0ii 4305	. . 3 ⊢ ℝ ≠ ∅
3		ral0 4458	. . . . 5 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))
4		c1lip1.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ)
5	4	rexrd 10693	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
6		c1lip1.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ)
7	6	rexrd 10693	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
8		icc0 12789	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴))
9	5, 7, 8	syl2anc 586	. . . . . . 7 ⊢ (𝜑 → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴))
10	9	biimpar 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (𝐴[,]𝐵) = ∅)
11	10	raleqdv 3417	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))) ↔ ∀𝑥 ∈ ∅ ∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
12	3, 11	mpbiri 260	. . . 4 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
13	12	ralrimivw 3185	. . 3 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ∀𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
14		r19.2z 4442	. . 3 ⊢ ((ℝ ≠ ∅ ∧ ∀𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
15	2, 13, 14	sylancr 589	. 2 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
16	4	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ)
17	6	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ)
18		simpr 487	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵)
19		c1lip1.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑_pm ℝ))
20	19	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐹 ∈ (ℂ ↑_pm ℝ))
21		c1lip1.dv	. . . . . 6 ⊢ (𝜑 → ((ℝ D 𝐹) ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
22	21	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
23		c1lip1.cn	. . . . . 6 ⊢ (𝜑 → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
24	23	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ))
25		eqid 2823	. . . . 5 ⊢ sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < )
26	16, 17, 18, 20, 22, 24, 25	c1liplem1 24595	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) ∈ ℝ ∧ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))))
27		oveq1 7165	. . . . . . . 8 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → (𝑘 · (abs‘(𝑏 − 𝑎))) = (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))
28	27	breq2d 5080	. . . . . . 7 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎))) ↔ (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎)))))
29	28	imbi2d 343	. . . . . 6 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → ((𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ (𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))))
30	29	2ralbidv 3201	. . . . 5 ⊢ (𝑘 = sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))))
31	30	rspcev 3625	. . . 4 ⊢ ((sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) ∈ ℝ ∧ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (sup((abs “ ((ℝ D 𝐹) “ (𝐴[,]𝐵))), ℝ, < ) · (abs‘(𝑏 − 𝑎))))) → ∃𝑘 ∈ ℝ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))))
32	26, 31	syl 17	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∃𝑘 ∈ ℝ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))))
33		breq1 5071	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → (𝑎 < 𝑏 ↔ 𝑥 < 𝑏))
34		fveq2 6672	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → (𝐹‘𝑎) = (𝐹‘𝑥))
35	34	oveq2d 7174	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → ((𝐹‘𝑏) − (𝐹‘𝑎)) = ((𝐹‘𝑏) − (𝐹‘𝑥)))
36	35	fveq2d 6676	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) = (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))))
37		oveq2 7166	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → (𝑏 − 𝑎) = (𝑏 − 𝑥))
38	37	fveq2d 6676	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → (abs‘(𝑏 − 𝑎)) = (abs‘(𝑏 − 𝑥)))
39	38	oveq2d 7174	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑘 · (abs‘(𝑏 − 𝑎))) = (𝑘 · (abs‘(𝑏 − 𝑥))))
40	36, 39	breq12d 5081	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎))) ↔ (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥)))))
41	33, 40	imbi12d 347	. . . . . . . . 9 ⊢ (𝑎 = 𝑥 → ((𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ (𝑥 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥))))))
42		breq2 5072	. . . . . . . . . 10 ⊢ (𝑏 = 𝑦 → (𝑥 < 𝑏 ↔ 𝑥 < 𝑦))
43		fveq2 6672	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑦 → (𝐹‘𝑏) = (𝐹‘𝑦))
44	43	fvoveq1d 7180	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑦 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
45		fvoveq1 7181	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑦 → (abs‘(𝑏 − 𝑥)) = (abs‘(𝑦 − 𝑥)))
46	45	oveq2d 7174	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑦 → (𝑘 · (abs‘(𝑏 − 𝑥))) = (𝑘 · (abs‘(𝑦 − 𝑥))))
47	44, 46	breq12d 5081	. . . . . . . . . 10 ⊢ (𝑏 = 𝑦 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥))) ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
48	42, 47	imbi12d 347	. . . . . . . . 9 ⊢ (𝑏 = 𝑦 → ((𝑥 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑏 − 𝑥)))) ↔ (𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))))
49	41, 48	rspc2v 3635	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))))
50	49	ad2antlr 725	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 < 𝑦) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))))
51		pm2.27 42	. . . . . . . 8 ⊢ (𝑥 < 𝑦 → ((𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
52	51	adantl 484	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 < 𝑦) → ((𝑥 < 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
53	50, 52	syld 47	. . . . . 6 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 < 𝑦) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
54		0le0 11741	. . . . . . . . . 10 ⊢ 0 ≤ 0
55		fvres 6691	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) = (𝐹‘𝑥))
56	55	ad2antrl 726	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) = (𝐹‘𝑥))
57		cncff 23503	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℝ) → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ)
58	23, 57	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ)
59	58	ad2antrr 724	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ)
60		simpl 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ (𝐴[,]𝐵))
61		ffvelrn 6851	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) ∈ ℝ)
62	59, 60, 61	syl2an 597	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑥) ∈ ℝ)
63	56, 62	eqeltrrd 2916	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑥) ∈ ℝ)
64	63	recnd 10671	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑥) ∈ ℂ)
65	64	subidd 10987	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹‘𝑥) − (𝐹‘𝑥)) = 0)
66	65	abs00bd 14653	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) = 0)
67		iccssre 12821	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
68	4, 6, 67	syl2anc 586	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
69	68	ad3antrrr 728	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐴[,]𝐵) ⊆ ℝ)
70		simprl 769	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑥 ∈ (𝐴[,]𝐵))
71	69, 70	sseldd 3970	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑥 ∈ ℝ)
72	71	recnd 10671	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑥 ∈ ℂ)
73	72	subidd 10987	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 − 𝑥) = 0)
74	73	abs00bd 14653	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘(𝑥 − 𝑥)) = 0)
75	74	oveq2d 7174	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑘 · (abs‘(𝑥 − 𝑥))) = (𝑘 · 0))
76		simplr 767	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑘 ∈ ℝ)
77	76	recnd 10671	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → 𝑘 ∈ ℂ)
78	77	mul01d 10841	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑘 · 0) = 0)
79	75, 78	eqtrd 2858	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑘 · (abs‘(𝑥 − 𝑥))) = 0)
80	66, 79	breq12d 5081	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑥 − 𝑥))) ↔ 0 ≤ 0))
81	54, 80	mpbiri 260	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑥 − 𝑥))))
82		fveq2 6672	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
83	82	fvoveq1d 7180	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
84		fvoveq1 7181	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (abs‘(𝑥 − 𝑥)) = (abs‘(𝑦 − 𝑥)))
85	84	oveq2d 7174	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑘 · (abs‘(𝑥 − 𝑥))) = (𝑘 · (abs‘(𝑦 − 𝑥))))
86	83, 85	breq12d 5081	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑥 − 𝑥))) ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
87	81, 86	syl5ibcom 247	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 = 𝑦 → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
88	87	imp 409	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 = 𝑦) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
89	88	a1d 25	. . . . . 6 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑥 = 𝑦) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
90		breq1 5071	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑦 → (𝑎 < 𝑏 ↔ 𝑦 < 𝑏))
91		fveq2 6672	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑦 → (𝐹‘𝑎) = (𝐹‘𝑦))
92	91	oveq2d 7174	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑦 → ((𝐹‘𝑏) − (𝐹‘𝑎)) = ((𝐹‘𝑏) − (𝐹‘𝑦)))
93	92	fveq2d 6676	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑦 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) = (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))))
94		oveq2 7166	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑦 → (𝑏 − 𝑎) = (𝑏 − 𝑦))
95	94	fveq2d 6676	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑦 → (abs‘(𝑏 − 𝑎)) = (abs‘(𝑏 − 𝑦)))
96	95	oveq2d 7174	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑦 → (𝑘 · (abs‘(𝑏 − 𝑎))) = (𝑘 · (abs‘(𝑏 − 𝑦))))
97	93, 96	breq12d 5081	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑦 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎))) ↔ (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦)))))
98	90, 97	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑎 = 𝑦 → ((𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) ↔ (𝑦 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦))))))
99		breq2 5072	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑥 → (𝑦 < 𝑏 ↔ 𝑦 < 𝑥))
100		fveq2 6672	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑥 → (𝐹‘𝑏) = (𝐹‘𝑥))
101	100	fvoveq1d 7180	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑥 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) = (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))))
102		fvoveq1 7181	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑥 → (abs‘(𝑏 − 𝑦)) = (abs‘(𝑥 − 𝑦)))
103	102	oveq2d 7174	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑥 → (𝑘 · (abs‘(𝑏 − 𝑦))) = (𝑘 · (abs‘(𝑥 − 𝑦))))
104	101, 103	breq12d 5081	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑥 → ((abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦))) ↔ (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦)))))
105	99, 104	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑏 = 𝑥 → ((𝑦 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑏 − 𝑦)))) ↔ (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
106	98, 105	rspc2v 3635	. . . . . . . . 9 ⊢ ((𝑦 ∈ (𝐴[,]𝐵) ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
107	106	ancoms 461	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
108	107	ad2antlr 725	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (𝑦 < 𝑥 → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))))))
109		simpr 487	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → 𝑦 < 𝑥)
110		fvres 6691	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) = (𝐹‘𝑦))
111	110	ad2antll 727	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) = (𝐹‘𝑦))
112		simpr 487	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑦 ∈ (𝐴[,]𝐵))
113		ffvelrn 6851	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)⟶ℝ ∧ 𝑦 ∈ (𝐴[,]𝐵)) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) ∈ ℝ)
114	59, 112, 113	syl2an 597	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝑦) ∈ ℝ)
115	111, 114	eqeltrrd 2916	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑦) ∈ ℝ)
116	115	recnd 10671	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝐹‘𝑦) ∈ ℂ)
117	64, 116	abssubd 14815	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
118	117	adantr 483	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) = (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))))
119	68	ad2antrr 724	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
120	119	sseld 3968	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝑥 ∈ (𝐴[,]𝐵) → 𝑥 ∈ ℝ))
121	119	sseld 3968	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (𝑦 ∈ (𝐴[,]𝐵) → 𝑦 ∈ ℝ))
122	120, 121	anim12d 610	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → ((𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)))
123	122	imp 409	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ))
124		recn 10629	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ)
125		recn 10629	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ)
126		abssub 14688	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
127	124, 125, 126	syl2an 597	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
128	123, 127	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
129	128	adantr 483	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (abs‘(𝑥 − 𝑦)) = (abs‘(𝑦 − 𝑥)))
130	129	oveq2d 7174	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → (𝑘 · (abs‘(𝑥 − 𝑦))) = (𝑘 · (abs‘(𝑦 − 𝑥))))
131	118, 130	breq12d 5081	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) ∧ 𝑦 < 𝑥) → ((abs‘((𝐹‘𝑥) − (𝐹‘𝑦))) ≤ (𝑘 · (abs‘(𝑥 − 𝑦))) ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
132	131	biimpd 231	. . . . . . . 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 10727	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
136	123, 135	syl 17	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
137	53, 89, 134, 136	mpjao3dan 1427	. . . . 5 ⊢ ((((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) ∧ (𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦 ∈ (𝐴[,]𝐵))) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → (abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
138	137	ralrimdvva 3196	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑘 ∈ ℝ) → (∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
139	138	reximdva 3276	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (∃𝑘 ∈ ℝ ∀𝑎 ∈ (𝐴[,]𝐵)∀𝑏 ∈ (𝐴[,]𝐵)(𝑎 < 𝑏 → (abs‘((𝐹‘𝑏) − (𝐹‘𝑎))) ≤ (𝑘 · (abs‘(𝑏 − 𝑎)))) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥)))))
140	32, 139	mpd 15	. 2 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))
141	15, 140, 6, 4	ltlecasei 10750	1 ⊢ (𝜑 → ∃𝑘 ∈ ℝ ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(abs‘((𝐹‘𝑦) − (𝐹‘𝑥))) ≤ (𝑘 · (abs‘(𝑦 − 𝑥))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∨ w3o 1082 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ∀wral 3140 ∃wrex 3141 ⊆ wss 3938 ∅c0 4293 class class class wbr 5068 ↾ cres 5559 “ cima 5560 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 ↑_pm cpm 8409 supcsup 8906 ℂcc 10537 ℝcr 10538 0cc0 10539 · cmul 10544 ℝ^*cxr 10676 < clt 10677 ≤ cle 10678 − cmin 10872 [,]cicc 12744 abscabs 14595 –cn→ccncf 23486 D cdv 24463

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 ax-addf 10618 ax-mulf 10619

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-iin 4924 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-se 5517 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-isom 6366 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-of 7411 df-om 7583 df-1st 7691 df-2nd 7692 df-supp 7833 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-2o 8105 df-oadd 8108 df-er 8291 df-map 8410 df-pm 8411 df-ixp 8464 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-fsupp 8836 df-fi 8877 df-sup 8908 df-inf 8909 df-oi 8976 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-q 12352 df-rp 12393 df-xneg 12510 df-xadd 12511 df-xmul 12512 df-ioo 12745 df-ico 12747 df-icc 12748 df-fz 12896 df-fzo 13037 df-seq 13373 df-exp 13433 df-hash 13694 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-struct 16487 df-ndx 16488 df-slot 16489 df-base 16491 df-sets 16492 df-ress 16493 df-plusg 16580 df-mulr 16581 df-starv 16582 df-sca 16583 df-vsca 16584 df-ip 16585 df-tset 16586 df-ple 16587 df-ds 16589 df-unif 16590 df-hom 16591 df-cco 16592 df-rest 16698 df-topn 16699 df-0g 16717 df-gsum 16718 df-topgen 16719 df-pt 16720 df-prds 16723 df-xrs 16777 df-qtop 16782 df-imas 16783 df-xps 16785 df-mre 16859 df-mrc 16860 df-acs 16862 df-mgm 17854 df-sgrp 17903 df-mnd 17914 df-submnd 17959 df-mulg 18227 df-cntz 18449 df-cmn 18910 df-psmet 20539 df-xmet 20540 df-met 20541 df-bl 20542 df-mopn 20543 df-fbas 20544 df-fg 20545 df-cnfld 20548 df-top 21504 df-topon 21521 df-topsp 21543 df-bases 21556 df-cld 21629 df-ntr 21630 df-cls 21631 df-nei 21708 df-lp 21746 df-perf 21747 df-cn 21837 df-cnp 21838 df-haus 21925 df-cmp 21997 df-tx 22172 df-hmeo 22365 df-fil 22456 df-fm 22548 df-flim 22549 df-flf 22550 df-xms 22932 df-ms 22933 df-tms 22934 df-cncf 23488 df-limc 24466 df-dv 24467

This theorem is referenced by: c1lip2 24597

W3C validator