dvle - Metamath Proof Explorer

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

Theorem dvle 25076

Description: If 𝐴(𝑥), 𝐶(𝑥) are differentiable functions and 𝐴‘ ≤ 𝐶‘, then for 𝑥 ≤ 𝑦, 𝐴(𝑦) − 𝐴(𝑥) ≤ 𝐶(𝑦) − 𝐶(𝑥). (Contributed by Mario Carneiro, 16-May-2016.)

**Hypotheses**
Ref	Expression
dvle.m	⊢ (𝜑 → 𝑀 ∈ ℝ)
dvle.n	⊢ (𝜑 → 𝑁 ∈ ℝ)
dvle.a	⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴) ∈ ((𝑀[,]𝑁)–cn→ℝ))
dvle.b	⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)) = (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵))
dvle.c	⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶) ∈ ((𝑀[,]𝑁)–cn→ℝ))
dvle.d	⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)) = (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷))
dvle.f	⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐵 ≤ 𝐷)
dvle.x	⊢ (𝜑 → 𝑋 ∈ (𝑀[,]𝑁))
dvle.y	⊢ (𝜑 → 𝑌 ∈ (𝑀[,]𝑁))
dvle.l	⊢ (𝜑 → 𝑋 ≤ 𝑌)
dvle.p	⊢ (𝑥 = 𝑋 → 𝐴 = 𝑃)
dvle.q	⊢ (𝑥 = 𝑋 → 𝐶 = 𝑄)
dvle.r	⊢ (𝑥 = 𝑌 → 𝐴 = 𝑅)
dvle.s	⊢ (𝑥 = 𝑌 → 𝐶 = 𝑆)

**Assertion**
Ref	Expression
dvle	⊢ (𝜑 → (𝑅 − 𝑃) ≤ (𝑆 − 𝑄))

Distinct variable groups: 𝑥,𝑀 𝑥,𝑁 𝑥,𝑃 𝑥,𝑄 𝑥,𝑅 𝑥,𝑆 𝑥,𝑋 𝜑,𝑥 𝑥,𝑌 Allowed substitution hints: 𝐴(𝑥) 𝐵(𝑥) 𝐶(𝑥) 𝐷(𝑥)

**Proof of Theorem dvle**
Step	Hyp	Ref	Expression
1		dvle.r	. . . 4 ⊢ (𝑥 = 𝑌 → 𝐴 = 𝑅)
2	1	eleq1d 2823	. . 3 ⊢ (𝑥 = 𝑌 → (𝐴 ∈ ℝ ↔ 𝑅 ∈ ℝ))
3		dvle.a	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴) ∈ ((𝑀[,]𝑁)–cn→ℝ))
4		cncff 23962	. . . . 5 ⊢ ((𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴) ∈ ((𝑀[,]𝑁)–cn→ℝ) → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴):(𝑀[,]𝑁)⟶ℝ)
5	3, 4	syl 17	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴):(𝑀[,]𝑁)⟶ℝ)
6		eqid 2738	. . . . 5 ⊢ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴) = (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴)
7	6	fmpt 6966	. . . 4 ⊢ (∀𝑥 ∈ (𝑀[,]𝑁)𝐴 ∈ ℝ ↔ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴):(𝑀[,]𝑁)⟶ℝ)
8	5, 7	sylibr 233	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀[,]𝑁)𝐴 ∈ ℝ)
9		dvle.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ (𝑀[,]𝑁))
10	2, 8, 9	rspcdva 3554	. 2 ⊢ (𝜑 → 𝑅 ∈ ℝ)
11		dvle.s	. . . . 5 ⊢ (𝑥 = 𝑌 → 𝐶 = 𝑆)
12	11	eleq1d 2823	. . . 4 ⊢ (𝑥 = 𝑌 → (𝐶 ∈ ℝ ↔ 𝑆 ∈ ℝ))
13		dvle.c	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶) ∈ ((𝑀[,]𝑁)–cn→ℝ))
14		cncff 23962	. . . . . 6 ⊢ ((𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶) ∈ ((𝑀[,]𝑁)–cn→ℝ) → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶):(𝑀[,]𝑁)⟶ℝ)
15	13, 14	syl 17	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶):(𝑀[,]𝑁)⟶ℝ)
16		eqid 2738	. . . . . 6 ⊢ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶) = (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶)
17	16	fmpt 6966	. . . . 5 ⊢ (∀𝑥 ∈ (𝑀[,]𝑁)𝐶 ∈ ℝ ↔ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶):(𝑀[,]𝑁)⟶ℝ)
18	15, 17	sylibr 233	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀[,]𝑁)𝐶 ∈ ℝ)
19	12, 18, 9	rspcdva 3554	. . 3 ⊢ (𝜑 → 𝑆 ∈ ℝ)
20		dvle.q	. . . . 5 ⊢ (𝑥 = 𝑋 → 𝐶 = 𝑄)
21	20	eleq1d 2823	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐶 ∈ ℝ ↔ 𝑄 ∈ ℝ))
22		dvle.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑀[,]𝑁))
23	21, 18, 22	rspcdva 3554	. . 3 ⊢ (𝜑 → 𝑄 ∈ ℝ)
24	19, 23	resubcld 11333	. 2 ⊢ (𝜑 → (𝑆 − 𝑄) ∈ ℝ)
25		dvle.p	. . . 4 ⊢ (𝑥 = 𝑋 → 𝐴 = 𝑃)
26	25	eleq1d 2823	. . 3 ⊢ (𝑥 = 𝑋 → (𝐴 ∈ ℝ ↔ 𝑃 ∈ ℝ))
27	26, 8, 22	rspcdva 3554	. 2 ⊢ (𝜑 → 𝑃 ∈ ℝ)
28	10	recnd 10934	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℂ)
29	23	recnd 10934	. . . . . 6 ⊢ (𝜑 → 𝑄 ∈ ℂ)
30	19	recnd 10934	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ ℂ)
31	29, 30	subcld 11262	. . . . 5 ⊢ (𝜑 → (𝑄 − 𝑆) ∈ ℂ)
32	28, 31	addcomd 11107	. . . 4 ⊢ (𝜑 → (𝑅 + (𝑄 − 𝑆)) = ((𝑄 − 𝑆) + 𝑅))
33	28, 30, 29	subsub2d 11291	. . . 4 ⊢ (𝜑 → (𝑅 − (𝑆 − 𝑄)) = (𝑅 + (𝑄 − 𝑆)))
34	29, 30, 28	subsubd 11290	. . . 4 ⊢ (𝜑 → (𝑄 − (𝑆 − 𝑅)) = ((𝑄 − 𝑆) + 𝑅))
35	32, 33, 34	3eqtr4d 2788	. . 3 ⊢ (𝜑 → (𝑅 − (𝑆 − 𝑄)) = (𝑄 − (𝑆 − 𝑅)))
36	19, 10	resubcld 11333	. . . 4 ⊢ (𝜑 → (𝑆 − 𝑅) ∈ ℝ)
37		dvle.m	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ)
38		dvle.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℝ)
39		eqid 2738	. . . . . . 7 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
40	39	subcn 23935	. . . . . . 7 ⊢ − ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld))
41		ax-resscn 10859	. . . . . . 7 ⊢ ℝ ⊆ ℂ
42		resubcl 11215	. . . . . . 7 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐶 − 𝐴) ∈ ℝ)
43	39, 40, 13, 3, 41, 42	cncfmpt2ss 23985	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴)) ∈ ((𝑀[,]𝑁)–cn→ℝ))
44	41	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → ℝ ⊆ ℂ)
45		iccssre 13090	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑀[,]𝑁) ⊆ ℝ)
46	37, 38, 45	syl2anc 583	. . . . . . . . 9 ⊢ (𝜑 → (𝑀[,]𝑁) ⊆ ℝ)
47	15	fvmptelrn 6969	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐶 ∈ ℝ)
48	5	fvmptelrn 6969	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐴 ∈ ℝ)
49	47, 48	resubcld 11333	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → (𝐶 − 𝐴) ∈ ℝ)
50	49	recnd 10934	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → (𝐶 − 𝐴) ∈ ℂ)
51	39	tgioo2 23872	. . . . . . . . 9 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
52		iccntr 23890	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝑀[,]𝑁)) = (𝑀(,)𝑁))
53	37, 38, 52	syl2anc 583	. . . . . . . . 9 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝑀[,]𝑁)) = (𝑀(,)𝑁))
54	44, 46, 50, 51, 39, 53	dvmptntr 25040	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))) = (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐶 − 𝐴))))
55		reelprrecn 10894	. . . . . . . . . 10 ⊢ ℝ ∈ {ℝ, ℂ}
56	55	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → ℝ ∈ {ℝ, ℂ})
57		ioossicc 13094	. . . . . . . . . . 11 ⊢ (𝑀(,)𝑁) ⊆ (𝑀[,]𝑁)
58	57	sseli 3913	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝑀(,)𝑁) → 𝑥 ∈ (𝑀[,]𝑁))
59	47	recnd 10934	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐶 ∈ ℂ)
60	58, 59	sylan2 592	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐶 ∈ ℂ)
61		dvle.f	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐵 ≤ 𝐷)
62		lerel 10970	. . . . . . . . . . 11 ⊢ Rel ≤
63	62	brrelex2i 5635	. . . . . . . . . 10 ⊢ (𝐵 ≤ 𝐷 → 𝐷 ∈ V)
64	61, 63	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐷 ∈ V)
65		dvle.d	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)) = (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷))
66	48	recnd 10934	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐴 ∈ ℂ)
67	58, 66	sylan2 592	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐴 ∈ ℂ)
68	62	brrelex1i 5634	. . . . . . . . . 10 ⊢ (𝐵 ≤ 𝐷 → 𝐵 ∈ V)
69	61, 68	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐵 ∈ V)
70		dvle.b	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)) = (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵))
71	56, 60, 64, 65, 67, 69, 70	dvmptsub 25036	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐶 − 𝐴))) = (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐷 − 𝐵)))
72	54, 71	eqtrd 2778	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))) = (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐷 − 𝐵)))
73	58, 47	sylan2 592	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐶 ∈ ℝ)
74	73	fmpttd 6971	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶):(𝑀(,)𝑁)⟶ℝ)
75		ioossre 13069	. . . . . . . . . . . 12 ⊢ (𝑀(,)𝑁) ⊆ ℝ
76		dvfre 25020	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶):(𝑀(,)𝑁)⟶ℝ ∧ (𝑀(,)𝑁) ⊆ ℝ) → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶))⟶ℝ)
77	74, 75, 76	sylancl 585	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶))⟶ℝ)
78	65	dmeqd 5803	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)) = dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷))
79	64	ralrimiva 3107	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀(,)𝑁)𝐷 ∈ V)
80		dmmptg 6134	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ (𝑀(,)𝑁)𝐷 ∈ V → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷) = (𝑀(,)𝑁))
81	79, 80	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷) = (𝑀(,)𝑁))
82	78, 81	eqtrd 2778	. . . . . . . . . . . 12 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)) = (𝑀(,)𝑁))
83	65, 82	feq12d 6572	. . . . . . . . . . 11 ⊢ (𝜑 → ((ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶))⟶ℝ ↔ (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷):(𝑀(,)𝑁)⟶ℝ))
84	77, 83	mpbid 231	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷):(𝑀(,)𝑁)⟶ℝ)
85	84	fvmptelrn 6969	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐷 ∈ ℝ)
86	58, 48	sylan2 592	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐴 ∈ ℝ)
87	86	fmpttd 6971	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴):(𝑀(,)𝑁)⟶ℝ)
88		dvfre 25020	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴):(𝑀(,)𝑁)⟶ℝ ∧ (𝑀(,)𝑁) ⊆ ℝ) → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴))⟶ℝ)
89	87, 75, 88	sylancl 585	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴))⟶ℝ)
90	70	dmeqd 5803	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)) = dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵))
91	69	ralrimiva 3107	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀(,)𝑁)𝐵 ∈ V)
92		dmmptg 6134	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ (𝑀(,)𝑁)𝐵 ∈ V → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵) = (𝑀(,)𝑁))
93	91, 92	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵) = (𝑀(,)𝑁))
94	90, 93	eqtrd 2778	. . . . . . . . . . . 12 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)) = (𝑀(,)𝑁))
95	70, 94	feq12d 6572	. . . . . . . . . . 11 ⊢ (𝜑 → ((ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴))⟶ℝ ↔ (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵):(𝑀(,)𝑁)⟶ℝ))
96	89, 95	mpbid 231	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵):(𝑀(,)𝑁)⟶ℝ)
97	96	fvmptelrn 6969	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐵 ∈ ℝ)
98	85, 97	resubcld 11333	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → (𝐷 − 𝐵) ∈ ℝ)
99	85, 97	subge0d 11495	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → (0 ≤ (𝐷 − 𝐵) ↔ 𝐵 ≤ 𝐷))
100	61, 99	mpbird 256	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 0 ≤ (𝐷 − 𝐵))
101		elrege0 13115	. . . . . . . 8 ⊢ ((𝐷 − 𝐵) ∈ (0[,)+∞) ↔ ((𝐷 − 𝐵) ∈ ℝ ∧ 0 ≤ (𝐷 − 𝐵)))
102	98, 100, 101	sylanbrc 582	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → (𝐷 − 𝐵) ∈ (0[,)+∞))
103	72, 102	fmpt3d 6972	. . . . . 6 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))):(𝑀(,)𝑁)⟶(0[,)+∞))
104		dvle.l	. . . . . 6 ⊢ (𝜑 → 𝑋 ≤ 𝑌)
105	37, 38, 43, 103, 22, 9, 104	dvge0 25075	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑋) ≤ ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑌))
106	20, 25	oveq12d 7273	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐶 − 𝐴) = (𝑄 − 𝑃))
107		eqid 2738	. . . . . . 7 ⊢ (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴)) = (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))
108		ovex 7288	. . . . . . 7 ⊢ (𝐶 − 𝐴) ∈ V
109	106, 107, 108	fvmpt3i 6862	. . . . . 6 ⊢ (𝑋 ∈ (𝑀[,]𝑁) → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑋) = (𝑄 − 𝑃))
110	22, 109	syl 17	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑋) = (𝑄 − 𝑃))
111	11, 1	oveq12d 7273	. . . . . . 7 ⊢ (𝑥 = 𝑌 → (𝐶 − 𝐴) = (𝑆 − 𝑅))
112	111, 107, 108	fvmpt3i 6862	. . . . . 6 ⊢ (𝑌 ∈ (𝑀[,]𝑁) → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑌) = (𝑆 − 𝑅))
113	9, 112	syl 17	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑌) = (𝑆 − 𝑅))
114	105, 110, 113	3brtr3d 5101	. . . 4 ⊢ (𝜑 → (𝑄 − 𝑃) ≤ (𝑆 − 𝑅))
115	23, 27, 36, 114	subled 11508	. . 3 ⊢ (𝜑 → (𝑄 − (𝑆 − 𝑅)) ≤ 𝑃)
116	35, 115	eqbrtrd 5092	. 2 ⊢ (𝜑 → (𝑅 − (𝑆 − 𝑄)) ≤ 𝑃)
117	10, 24, 27, 116	subled 11508	1 ⊢ (𝜑 → (𝑅 − 𝑃) ≤ (𝑆 − 𝑄))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∀wral 3063 Vcvv 3422 ⊆ wss 3883 {cpr 4560 class class class wbr 5070 ↦ cmpt 5153 dom cdm 5580 ran crn 5581 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ℝcr 10801 0cc0 10802 + caddc 10805 +∞cpnf 10937 ≤ cle 10941 − cmin 11135 (,)cioo 13008 [,)cico 13010 [,]cicc 13011 TopOpenctopn 17049 topGenctg 17065 ℂ_fldccnfld 20510 intcnt 22076 –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: dvfsumle 25090 dvfsumlem2 25096 loglesqrt 25816 dvle2 40008

W3C validator