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 25888

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 2813	. . 3 ⊢ (𝑥 = 𝑌 → (𝐴 ∈ ℝ ↔ 𝑅 ∈ ℝ))
3		dvle.a	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴) ∈ ((𝑀[,]𝑁)–cn→ℝ))
4		cncff 24762	. . . . 5 ⊢ ((𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴) ∈ ((𝑀[,]𝑁)–cn→ℝ) → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴):(𝑀[,]𝑁)⟶ℝ)
5	3, 4	syl 17	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴):(𝑀[,]𝑁)⟶ℝ)
6		eqid 2729	. . . . 5 ⊢ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴) = (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴)
7	6	fmpt 7064	. . . 4 ⊢ (∀𝑥 ∈ (𝑀[,]𝑁)𝐴 ∈ ℝ ↔ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴):(𝑀[,]𝑁)⟶ℝ)
8	5, 7	sylibr 234	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀[,]𝑁)𝐴 ∈ ℝ)
9		dvle.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ (𝑀[,]𝑁))
10	2, 8, 9	rspcdva 3586	. 2 ⊢ (𝜑 → 𝑅 ∈ ℝ)
11		dvle.s	. . . . 5 ⊢ (𝑥 = 𝑌 → 𝐶 = 𝑆)
12	11	eleq1d 2813	. . . 4 ⊢ (𝑥 = 𝑌 → (𝐶 ∈ ℝ ↔ 𝑆 ∈ ℝ))
13		dvle.c	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶) ∈ ((𝑀[,]𝑁)–cn→ℝ))
14		cncff 24762	. . . . . 6 ⊢ ((𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶) ∈ ((𝑀[,]𝑁)–cn→ℝ) → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶):(𝑀[,]𝑁)⟶ℝ)
15	13, 14	syl 17	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶):(𝑀[,]𝑁)⟶ℝ)
16		eqid 2729	. . . . . 6 ⊢ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶) = (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶)
17	16	fmpt 7064	. . . . 5 ⊢ (∀𝑥 ∈ (𝑀[,]𝑁)𝐶 ∈ ℝ ↔ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶):(𝑀[,]𝑁)⟶ℝ)
18	15, 17	sylibr 234	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀[,]𝑁)𝐶 ∈ ℝ)
19	12, 18, 9	rspcdva 3586	. . 3 ⊢ (𝜑 → 𝑆 ∈ ℝ)
20		dvle.q	. . . . 5 ⊢ (𝑥 = 𝑋 → 𝐶 = 𝑄)
21	20	eleq1d 2813	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐶 ∈ ℝ ↔ 𝑄 ∈ ℝ))
22		dvle.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑀[,]𝑁))
23	21, 18, 22	rspcdva 3586	. . 3 ⊢ (𝜑 → 𝑄 ∈ ℝ)
24	19, 23	resubcld 11582	. 2 ⊢ (𝜑 → (𝑆 − 𝑄) ∈ ℝ)
25		dvle.p	. . . 4 ⊢ (𝑥 = 𝑋 → 𝐴 = 𝑃)
26	25	eleq1d 2813	. . 3 ⊢ (𝑥 = 𝑋 → (𝐴 ∈ ℝ ↔ 𝑃 ∈ ℝ))
27	26, 8, 22	rspcdva 3586	. 2 ⊢ (𝜑 → 𝑃 ∈ ℝ)
28	10	recnd 11178	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℂ)
29	23	recnd 11178	. . . . . 6 ⊢ (𝜑 → 𝑄 ∈ ℂ)
30	19	recnd 11178	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ ℂ)
31	29, 30	subcld 11509	. . . . 5 ⊢ (𝜑 → (𝑄 − 𝑆) ∈ ℂ)
32	28, 31	addcomd 11352	. . . 4 ⊢ (𝜑 → (𝑅 + (𝑄 − 𝑆)) = ((𝑄 − 𝑆) + 𝑅))
33	28, 30, 29	subsub2d 11538	. . . 4 ⊢ (𝜑 → (𝑅 − (𝑆 − 𝑄)) = (𝑅 + (𝑄 − 𝑆)))
34	29, 30, 28	subsubd 11537	. . . 4 ⊢ (𝜑 → (𝑄 − (𝑆 − 𝑅)) = ((𝑄 − 𝑆) + 𝑅))
35	32, 33, 34	3eqtr4d 2774	. . 3 ⊢ (𝜑 → (𝑅 − (𝑆 − 𝑄)) = (𝑄 − (𝑆 − 𝑅)))
36	19, 10	resubcld 11582	. . . 4 ⊢ (𝜑 → (𝑆 − 𝑅) ∈ ℝ)
37		dvle.m	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ)
38		dvle.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℝ)
39		eqid 2729	. . . . . . 7 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
40	39	subcn 24731	. . . . . . 7 ⊢ − ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld))
41		ax-resscn 11101	. . . . . . 7 ⊢ ℝ ⊆ ℂ
42		resubcl 11462	. . . . . . 7 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐶 − 𝐴) ∈ ℝ)
43	39, 40, 13, 3, 41, 42	cncfmpt2ss 24785	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴)) ∈ ((𝑀[,]𝑁)–cn→ℝ))
44	41	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → ℝ ⊆ ℂ)
45		iccssre 13366	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑀[,]𝑁) ⊆ ℝ)
46	37, 38, 45	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (𝑀[,]𝑁) ⊆ ℝ)
47	15	fvmptelcdm 7067	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐶 ∈ ℝ)
48	5	fvmptelcdm 7067	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐴 ∈ ℝ)
49	47, 48	resubcld 11582	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → (𝐶 − 𝐴) ∈ ℝ)
50	49	recnd 11178	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → (𝐶 − 𝐴) ∈ ℂ)
51		tgioo4 24669	. . . . . . . . 9 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
52		iccntr 24686	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝑀[,]𝑁)) = (𝑀(,)𝑁))
53	37, 38, 52	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝑀[,]𝑁)) = (𝑀(,)𝑁))
54	44, 46, 50, 51, 39, 53	dvmptntr 25851	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))) = (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐶 − 𝐴))))
55		reelprrecn 11136	. . . . . . . . . 10 ⊢ ℝ ∈ {ℝ, ℂ}
56	55	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → ℝ ∈ {ℝ, ℂ})
57		ioossicc 13370	. . . . . . . . . . 11 ⊢ (𝑀(,)𝑁) ⊆ (𝑀[,]𝑁)
58	57	sseli 3939	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝑀(,)𝑁) → 𝑥 ∈ (𝑀[,]𝑁))
59	47	recnd 11178	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐶 ∈ ℂ)
60	58, 59	sylan2 593	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐶 ∈ ℂ)
61		dvle.f	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐵 ≤ 𝐷)
62		lerel 11214	. . . . . . . . . . 11 ⊢ Rel ≤
63	62	brrelex2i 5688	. . . . . . . . . 10 ⊢ (𝐵 ≤ 𝐷 → 𝐷 ∈ V)
64	61, 63	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐷 ∈ V)
65		dvle.d	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)) = (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷))
66	48	recnd 11178	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐴 ∈ ℂ)
67	58, 66	sylan2 593	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐴 ∈ ℂ)
68	62	brrelex1i 5687	. . . . . . . . . 10 ⊢ (𝐵 ≤ 𝐷 → 𝐵 ∈ V)
69	61, 68	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐵 ∈ V)
70		dvle.b	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)) = (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵))
71	56, 60, 64, 65, 67, 69, 70	dvmptsub 25847	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐶 − 𝐴))) = (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐷 − 𝐵)))
72	54, 71	eqtrd 2764	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))) = (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐷 − 𝐵)))
73	58, 47	sylan2 593	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐶 ∈ ℝ)
74	73	fmpttd 7069	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶):(𝑀(,)𝑁)⟶ℝ)
75		ioossre 13344	. . . . . . . . . . . 12 ⊢ (𝑀(,)𝑁) ⊆ ℝ
76		dvfre 25831	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶):(𝑀(,)𝑁)⟶ℝ ∧ (𝑀(,)𝑁) ⊆ ℝ) → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶))⟶ℝ)
77	74, 75, 76	sylancl 586	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶))⟶ℝ)
78	65	dmeqd 5859	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)) = dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷))
79	64	ralrimiva 3125	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀(,)𝑁)𝐷 ∈ V)
80		dmmptg 6203	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ (𝑀(,)𝑁)𝐷 ∈ V → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷) = (𝑀(,)𝑁))
81	79, 80	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷) = (𝑀(,)𝑁))
82	78, 81	eqtrd 2764	. . . . . . . . . . . 12 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)) = (𝑀(,)𝑁))
83	65, 82	feq12d 6658	. . . . . . . . . . 11 ⊢ (𝜑 → ((ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶))⟶ℝ ↔ (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷):(𝑀(,)𝑁)⟶ℝ))
84	77, 83	mpbid 232	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷):(𝑀(,)𝑁)⟶ℝ)
85	84	fvmptelcdm 7067	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐷 ∈ ℝ)
86	58, 48	sylan2 593	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐴 ∈ ℝ)
87	86	fmpttd 7069	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴):(𝑀(,)𝑁)⟶ℝ)
88		dvfre 25831	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴):(𝑀(,)𝑁)⟶ℝ ∧ (𝑀(,)𝑁) ⊆ ℝ) → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴))⟶ℝ)
89	87, 75, 88	sylancl 586	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴))⟶ℝ)
90	70	dmeqd 5859	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)) = dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵))
91	69	ralrimiva 3125	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀(,)𝑁)𝐵 ∈ V)
92		dmmptg 6203	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ (𝑀(,)𝑁)𝐵 ∈ V → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵) = (𝑀(,)𝑁))
93	91, 92	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵) = (𝑀(,)𝑁))
94	90, 93	eqtrd 2764	. . . . . . . . . . . 12 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)) = (𝑀(,)𝑁))
95	70, 94	feq12d 6658	. . . . . . . . . . 11 ⊢ (𝜑 → ((ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴))⟶ℝ ↔ (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵):(𝑀(,)𝑁)⟶ℝ))
96	89, 95	mpbid 232	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵):(𝑀(,)𝑁)⟶ℝ)
97	96	fvmptelcdm 7067	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐵 ∈ ℝ)
98	85, 97	resubcld 11582	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → (𝐷 − 𝐵) ∈ ℝ)
99	85, 97	subge0d 11744	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → (0 ≤ (𝐷 − 𝐵) ↔ 𝐵 ≤ 𝐷))
100	61, 99	mpbird 257	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 0 ≤ (𝐷 − 𝐵))
101		elrege0 13391	. . . . . . . 8 ⊢ ((𝐷 − 𝐵) ∈ (0[,)+∞) ↔ ((𝐷 − 𝐵) ∈ ℝ ∧ 0 ≤ (𝐷 − 𝐵)))
102	98, 100, 101	sylanbrc 583	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → (𝐷 − 𝐵) ∈ (0[,)+∞))
103	72, 102	fmpt3d 7070	. . . . . 6 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))):(𝑀(,)𝑁)⟶(0[,)+∞))
104		dvle.l	. . . . . 6 ⊢ (𝜑 → 𝑋 ≤ 𝑌)
105	37, 38, 43, 103, 22, 9, 104	dvge0 25887	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑋) ≤ ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑌))
106	20, 25	oveq12d 7387	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐶 − 𝐴) = (𝑄 − 𝑃))
107		eqid 2729	. . . . . . 7 ⊢ (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴)) = (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))
108		ovex 7402	. . . . . . 7 ⊢ (𝐶 − 𝐴) ∈ V
109	106, 107, 108	fvmpt3i 6955	. . . . . 6 ⊢ (𝑋 ∈ (𝑀[,]𝑁) → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑋) = (𝑄 − 𝑃))
110	22, 109	syl 17	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑋) = (𝑄 − 𝑃))
111	11, 1	oveq12d 7387	. . . . . . 7 ⊢ (𝑥 = 𝑌 → (𝐶 − 𝐴) = (𝑆 − 𝑅))
112	111, 107, 108	fvmpt3i 6955	. . . . . 6 ⊢ (𝑌 ∈ (𝑀[,]𝑁) → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑌) = (𝑆 − 𝑅))
113	9, 112	syl 17	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑌) = (𝑆 − 𝑅))
114	105, 110, 113	3brtr3d 5133	. . . 4 ⊢ (𝜑 → (𝑄 − 𝑃) ≤ (𝑆 − 𝑅))
115	23, 27, 36, 114	subled 11757	. . 3 ⊢ (𝜑 → (𝑄 − (𝑆 − 𝑅)) ≤ 𝑃)
116	35, 115	eqbrtrd 5124	. 2 ⊢ (𝜑 → (𝑅 − (𝑆 − 𝑄)) ≤ 𝑃)
117	10, 24, 27, 116	subled 11757	1 ⊢ (𝜑 → (𝑅 − 𝑃) ≤ (𝑆 − 𝑄))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3044 Vcvv 3444 ⊆ wss 3911 {cpr 4587 class class class wbr 5102 ↦ cmpt 5183 dom cdm 5631 ran crn 5632 ⟶wf 6495 ‘cfv 6499 (class class class)co 7369 ℂcc 11042 ℝcr 11043 0cc0 11044 + caddc 11047 +∞cpnf 11181 ≤ cle 11185 − cmin 11381 (,)cioo 13282 [,)cico 13284 [,]cicc 13285 TopOpenctopn 17360 topGenctg 17376 ℂ_fldccnfld 21240 intcnt 22880 –cn→ccncf 24745 D cdv 25740

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122 ax-addf 11123

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-isom 6508 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-of 7633 df-om 7823 df-1st 7947 df-2nd 7948 df-supp 8117 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-2o 8412 df-er 8648 df-map 8778 df-pm 8779 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fsupp 9289 df-fi 9338 df-sup 9369 df-inf 9370 df-oi 9439 df-card 9868 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-7 12230 df-8 12231 df-9 12232 df-n0 12419 df-z 12506 df-dec 12626 df-uz 12770 df-q 12884 df-rp 12928 df-xneg 13048 df-xadd 13049 df-xmul 13050 df-ioo 13286 df-ico 13288 df-icc 13289 df-fz 13445 df-fzo 13592 df-seq 13943 df-exp 14003 df-hash 14272 df-cj 15041 df-re 15042 df-im 15043 df-sqrt 15177 df-abs 15178 df-struct 17093 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-ress 17177 df-plusg 17209 df-mulr 17210 df-starv 17211 df-sca 17212 df-vsca 17213 df-ip 17214 df-tset 17215 df-ple 17216 df-ds 17218 df-unif 17219 df-hom 17220 df-cco 17221 df-rest 17361 df-topn 17362 df-0g 17380 df-gsum 17381 df-topgen 17382 df-pt 17383 df-prds 17386 df-xrs 17441 df-qtop 17446 df-imas 17447 df-xps 17449 df-mre 17523 df-mrc 17524 df-acs 17526 df-mgm 18543 df-sgrp 18622 df-mnd 18638 df-submnd 18687 df-mulg 18976 df-cntz 19225 df-cmn 19688 df-psmet 21232 df-xmet 21233 df-met 21234 df-bl 21235 df-mopn 21236 df-fbas 21237 df-fg 21238 df-cnfld 21241 df-top 22757 df-topon 22774 df-topsp 22796 df-bases 22809 df-cld 22882 df-ntr 22883 df-cls 22884 df-nei 22961 df-lp 22999 df-perf 23000 df-cn 23090 df-cnp 23091 df-haus 23178 df-cmp 23250 df-tx 23425 df-hmeo 23618 df-fil 23709 df-fm 23801 df-flim 23802 df-flf 23803 df-xms 24184 df-ms 24185 df-tms 24186 df-cncf 24747 df-limc 25743 df-dv 25744

This theorem is referenced by: dvfsumle 25902 dvfsumleOLD 25903 dvfsumlem2 25909 dvfsumlem2OLD 25910 loglesqrt 26647 dvle2 42033

W3C validator