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 25171

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 24056	. . . . 5 ⊢ ((𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴) ∈ ((𝑀[,]𝑁)–cn→ℝ) → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴):(𝑀[,]𝑁)⟶ℝ)
5	3, 4	syl 17	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴):(𝑀[,]𝑁)⟶ℝ)
6		eqid 2738	. . . . 5 ⊢ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴) = (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴)
7	6	fmpt 6984	. . . 4 ⊢ (∀𝑥 ∈ (𝑀[,]𝑁)𝐴 ∈ ℝ ↔ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐴):(𝑀[,]𝑁)⟶ℝ)
8	5, 7	sylibr 233	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀[,]𝑁)𝐴 ∈ ℝ)
9		dvle.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ (𝑀[,]𝑁))
10	2, 8, 9	rspcdva 3562	. 2 ⊢ (𝜑 → 𝑅 ∈ ℝ)
11		dvle.s	. . . . 5 ⊢ (𝑥 = 𝑌 → 𝐶 = 𝑆)
12	11	eleq1d 2823	. . . 4 ⊢ (𝑥 = 𝑌 → (𝐶 ∈ ℝ ↔ 𝑆 ∈ ℝ))
13		dvle.c	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶) ∈ ((𝑀[,]𝑁)–cn→ℝ))
14		cncff 24056	. . . . . 6 ⊢ ((𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶) ∈ ((𝑀[,]𝑁)–cn→ℝ) → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶):(𝑀[,]𝑁)⟶ℝ)
15	13, 14	syl 17	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶):(𝑀[,]𝑁)⟶ℝ)
16		eqid 2738	. . . . . 6 ⊢ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶) = (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶)
17	16	fmpt 6984	. . . . 5 ⊢ (∀𝑥 ∈ (𝑀[,]𝑁)𝐶 ∈ ℝ ↔ (𝑥 ∈ (𝑀[,]𝑁) ↦ 𝐶):(𝑀[,]𝑁)⟶ℝ)
18	15, 17	sylibr 233	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀[,]𝑁)𝐶 ∈ ℝ)
19	12, 18, 9	rspcdva 3562	. . 3 ⊢ (𝜑 → 𝑆 ∈ ℝ)
20		dvle.q	. . . . 5 ⊢ (𝑥 = 𝑋 → 𝐶 = 𝑄)
21	20	eleq1d 2823	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐶 ∈ ℝ ↔ 𝑄 ∈ ℝ))
22		dvle.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑀[,]𝑁))
23	21, 18, 22	rspcdva 3562	. . 3 ⊢ (𝜑 → 𝑄 ∈ ℝ)
24	19, 23	resubcld 11403	. 2 ⊢ (𝜑 → (𝑆 − 𝑄) ∈ ℝ)
25		dvle.p	. . . 4 ⊢ (𝑥 = 𝑋 → 𝐴 = 𝑃)
26	25	eleq1d 2823	. . 3 ⊢ (𝑥 = 𝑋 → (𝐴 ∈ ℝ ↔ 𝑃 ∈ ℝ))
27	26, 8, 22	rspcdva 3562	. 2 ⊢ (𝜑 → 𝑃 ∈ ℝ)
28	10	recnd 11003	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℂ)
29	23	recnd 11003	. . . . . 6 ⊢ (𝜑 → 𝑄 ∈ ℂ)
30	19	recnd 11003	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ ℂ)
31	29, 30	subcld 11332	. . . . 5 ⊢ (𝜑 → (𝑄 − 𝑆) ∈ ℂ)
32	28, 31	addcomd 11177	. . . 4 ⊢ (𝜑 → (𝑅 + (𝑄 − 𝑆)) = ((𝑄 − 𝑆) + 𝑅))
33	28, 30, 29	subsub2d 11361	. . . 4 ⊢ (𝜑 → (𝑅 − (𝑆 − 𝑄)) = (𝑅 + (𝑄 − 𝑆)))
34	29, 30, 28	subsubd 11360	. . . 4 ⊢ (𝜑 → (𝑄 − (𝑆 − 𝑅)) = ((𝑄 − 𝑆) + 𝑅))
35	32, 33, 34	3eqtr4d 2788	. . 3 ⊢ (𝜑 → (𝑅 − (𝑆 − 𝑄)) = (𝑄 − (𝑆 − 𝑅)))
36	19, 10	resubcld 11403	. . . 4 ⊢ (𝜑 → (𝑆 − 𝑅) ∈ ℝ)
37		dvle.m	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ)
38		dvle.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℝ)
39		eqid 2738	. . . . . . 7 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
40	39	subcn 24029	. . . . . . 7 ⊢ − ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld))
41		ax-resscn 10928	. . . . . . 7 ⊢ ℝ ⊆ ℂ
42		resubcl 11285	. . . . . . 7 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐶 − 𝐴) ∈ ℝ)
43	39, 40, 13, 3, 41, 42	cncfmpt2ss 24079	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴)) ∈ ((𝑀[,]𝑁)–cn→ℝ))
44	41	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → ℝ ⊆ ℂ)
45		iccssre 13161	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑀[,]𝑁) ⊆ ℝ)
46	37, 38, 45	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (𝑀[,]𝑁) ⊆ ℝ)
47	15	fvmptelrn 6987	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐶 ∈ ℝ)
48	5	fvmptelrn 6987	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐴 ∈ ℝ)
49	47, 48	resubcld 11403	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → (𝐶 − 𝐴) ∈ ℝ)
50	49	recnd 11003	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → (𝐶 − 𝐴) ∈ ℂ)
51	39	tgioo2 23966	. . . . . . . . 9 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
52		iccntr 23984	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝑀[,]𝑁)) = (𝑀(,)𝑁))
53	37, 38, 52	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝑀[,]𝑁)) = (𝑀(,)𝑁))
54	44, 46, 50, 51, 39, 53	dvmptntr 25135	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))) = (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐶 − 𝐴))))
55		reelprrecn 10963	. . . . . . . . . 10 ⊢ ℝ ∈ {ℝ, ℂ}
56	55	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → ℝ ∈ {ℝ, ℂ})
57		ioossicc 13165	. . . . . . . . . . 11 ⊢ (𝑀(,)𝑁) ⊆ (𝑀[,]𝑁)
58	57	sseli 3917	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝑀(,)𝑁) → 𝑥 ∈ (𝑀[,]𝑁))
59	47	recnd 11003	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐶 ∈ ℂ)
60	58, 59	sylan2 593	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐶 ∈ ℂ)
61		dvle.f	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐵 ≤ 𝐷)
62		lerel 11039	. . . . . . . . . . 11 ⊢ Rel ≤
63	62	brrelex2i 5644	. . . . . . . . . 10 ⊢ (𝐵 ≤ 𝐷 → 𝐷 ∈ V)
64	61, 63	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐷 ∈ V)
65		dvle.d	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)) = (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷))
66	48	recnd 11003	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝐴 ∈ ℂ)
67	58, 66	sylan2 593	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐴 ∈ ℂ)
68	62	brrelex1i 5643	. . . . . . . . . 10 ⊢ (𝐵 ≤ 𝐷 → 𝐵 ∈ V)
69	61, 68	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐵 ∈ V)
70		dvle.b	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)) = (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵))
71	56, 60, 64, 65, 67, 69, 70	dvmptsub 25131	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐶 − 𝐴))) = (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐷 − 𝐵)))
72	54, 71	eqtrd 2778	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))) = (𝑥 ∈ (𝑀(,)𝑁) ↦ (𝐷 − 𝐵)))
73	58, 47	sylan2 593	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐶 ∈ ℝ)
74	73	fmpttd 6989	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶):(𝑀(,)𝑁)⟶ℝ)
75		ioossre 13140	. . . . . . . . . . . 12 ⊢ (𝑀(,)𝑁) ⊆ ℝ
76		dvfre 25115	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶):(𝑀(,)𝑁)⟶ℝ ∧ (𝑀(,)𝑁) ⊆ ℝ) → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶))⟶ℝ)
77	74, 75, 76	sylancl 586	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶))⟶ℝ)
78	65	dmeqd 5814	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)) = dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷))
79	64	ralrimiva 3103	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀(,)𝑁)𝐷 ∈ V)
80		dmmptg 6145	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ (𝑀(,)𝑁)𝐷 ∈ V → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷) = (𝑀(,)𝑁))
81	79, 80	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷) = (𝑀(,)𝑁))
82	78, 81	eqtrd 2778	. . . . . . . . . . . 12 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)) = (𝑀(,)𝑁))
83	65, 82	feq12d 6588	. . . . . . . . . . 11 ⊢ (𝜑 → ((ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐶))⟶ℝ ↔ (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷):(𝑀(,)𝑁)⟶ℝ))
84	77, 83	mpbid 231	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐷):(𝑀(,)𝑁)⟶ℝ)
85	84	fvmptelrn 6987	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐷 ∈ ℝ)
86	58, 48	sylan2 593	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐴 ∈ ℝ)
87	86	fmpttd 6989	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴):(𝑀(,)𝑁)⟶ℝ)
88		dvfre 25115	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴):(𝑀(,)𝑁)⟶ℝ ∧ (𝑀(,)𝑁) ⊆ ℝ) → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴))⟶ℝ)
89	87, 75, 88	sylancl 586	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴))⟶ℝ)
90	70	dmeqd 5814	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)) = dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵))
91	69	ralrimiva 3103	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀(,)𝑁)𝐵 ∈ V)
92		dmmptg 6145	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ (𝑀(,)𝑁)𝐵 ∈ V → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵) = (𝑀(,)𝑁))
93	91, 92	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵) = (𝑀(,)𝑁))
94	90, 93	eqtrd 2778	. . . . . . . . . . . 12 ⊢ (𝜑 → dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)) = (𝑀(,)𝑁))
95	70, 94	feq12d 6588	. . . . . . . . . . 11 ⊢ (𝜑 → ((ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴)):dom (ℝ D (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐴))⟶ℝ ↔ (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵):(𝑀(,)𝑁)⟶ℝ))
96	89, 95	mpbid 231	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (𝑀(,)𝑁) ↦ 𝐵):(𝑀(,)𝑁)⟶ℝ)
97	96	fvmptelrn 6987	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 𝐵 ∈ ℝ)
98	85, 97	resubcld 11403	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → (𝐷 − 𝐵) ∈ ℝ)
99	85, 97	subge0d 11565	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → (0 ≤ (𝐷 − 𝐵) ↔ 𝐵 ≤ 𝐷))
100	61, 99	mpbird 256	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → 0 ≤ (𝐷 − 𝐵))
101		elrege0 13186	. . . . . . . 8 ⊢ ((𝐷 − 𝐵) ∈ (0[,)+∞) ↔ ((𝐷 − 𝐵) ∈ ℝ ∧ 0 ≤ (𝐷 − 𝐵)))
102	98, 100, 101	sylanbrc 583	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀(,)𝑁)) → (𝐷 − 𝐵) ∈ (0[,)+∞))
103	72, 102	fmpt3d 6990	. . . . . 6 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))):(𝑀(,)𝑁)⟶(0[,)+∞))
104		dvle.l	. . . . . 6 ⊢ (𝜑 → 𝑋 ≤ 𝑌)
105	37, 38, 43, 103, 22, 9, 104	dvge0 25170	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑋) ≤ ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑌))
106	20, 25	oveq12d 7293	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐶 − 𝐴) = (𝑄 − 𝑃))
107		eqid 2738	. . . . . . 7 ⊢ (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴)) = (𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))
108		ovex 7308	. . . . . . 7 ⊢ (𝐶 − 𝐴) ∈ V
109	106, 107, 108	fvmpt3i 6880	. . . . . 6 ⊢ (𝑋 ∈ (𝑀[,]𝑁) → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑋) = (𝑄 − 𝑃))
110	22, 109	syl 17	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑋) = (𝑄 − 𝑃))
111	11, 1	oveq12d 7293	. . . . . . 7 ⊢ (𝑥 = 𝑌 → (𝐶 − 𝐴) = (𝑆 − 𝑅))
112	111, 107, 108	fvmpt3i 6880	. . . . . 6 ⊢ (𝑌 ∈ (𝑀[,]𝑁) → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑌) = (𝑆 − 𝑅))
113	9, 112	syl 17	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝑀[,]𝑁) ↦ (𝐶 − 𝐴))‘𝑌) = (𝑆 − 𝑅))
114	105, 110, 113	3brtr3d 5105	. . . 4 ⊢ (𝜑 → (𝑄 − 𝑃) ≤ (𝑆 − 𝑅))
115	23, 27, 36, 114	subled 11578	. . 3 ⊢ (𝜑 → (𝑄 − (𝑆 − 𝑅)) ≤ 𝑃)
116	35, 115	eqbrtrd 5096	. 2 ⊢ (𝜑 → (𝑅 − (𝑆 − 𝑄)) ≤ 𝑃)
117	10, 24, 27, 116	subled 11578	1 ⊢ (𝜑 → (𝑅 − 𝑃) ≤ (𝑆 − 𝑄))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∀wral 3064 Vcvv 3432 ⊆ wss 3887 {cpr 4563 class class class wbr 5074 ↦ cmpt 5157 dom cdm 5589 ran crn 5590 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 ℂcc 10869 ℝcr 10870 0cc0 10871 + caddc 10874 +∞cpnf 11006 ≤ cle 11010 − cmin 11205 (,)cioo 13079 [,)cico 13081 [,]cicc 13082 TopOpenctopn 17132 topGenctg 17148 ℂ_fldccnfld 20597 intcnt 22168 –cn→ccncf 24039 D cdv 25027

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 ax-addf 10950 ax-mulf 10951

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-iin 4927 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-isom 6442 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-of 7533 df-om 7713 df-1st 7831 df-2nd 7832 df-supp 7978 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-2o 8298 df-er 8498 df-map 8617 df-pm 8618 df-ixp 8686 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-fsupp 9129 df-fi 9170 df-sup 9201 df-inf 9202 df-oi 9269 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-7 12041 df-8 12042 df-9 12043 df-n0 12234 df-z 12320 df-dec 12438 df-uz 12583 df-q 12689 df-rp 12731 df-xneg 12848 df-xadd 12849 df-xmul 12850 df-ioo 13083 df-ico 13085 df-icc 13086 df-fz 13240 df-fzo 13383 df-seq 13722 df-exp 13783 df-hash 14045 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 df-struct 16848 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-mulr 16976 df-starv 16977 df-sca 16978 df-vsca 16979 df-ip 16980 df-tset 16981 df-ple 16982 df-ds 16984 df-unif 16985 df-hom 16986 df-cco 16987 df-rest 17133 df-topn 17134 df-0g 17152 df-gsum 17153 df-topgen 17154 df-pt 17155 df-prds 17158 df-xrs 17213 df-qtop 17218 df-imas 17219 df-xps 17221 df-mre 17295 df-mrc 17296 df-acs 17298 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-submnd 18431 df-mulg 18701 df-cntz 18923 df-cmn 19388 df-psmet 20589 df-xmet 20590 df-met 20591 df-bl 20592 df-mopn 20593 df-fbas 20594 df-fg 20595 df-cnfld 20598 df-top 22043 df-topon 22060 df-topsp 22082 df-bases 22096 df-cld 22170 df-ntr 22171 df-cls 22172 df-nei 22249 df-lp 22287 df-perf 22288 df-cn 22378 df-cnp 22379 df-haus 22466 df-cmp 22538 df-tx 22713 df-hmeo 22906 df-fil 22997 df-fm 23089 df-flim 23090 df-flf 23091 df-xms 23473 df-ms 23474 df-tms 23475 df-cncf 24041 df-limc 25030 df-dv 25031

This theorem is referenced by: dvfsumle 25185 dvfsumlem2 25191 loglesqrt 25911 dvle2 40080

W3C validator