dvle2 - Mathbox for metakunt

	Mathbox for metakunt		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > dvle2		Structured version Visualization version GIF version

Theorem dvle2 42899

Description: Collapsed dvle 26219. (Contributed by metakunt, 19-Aug-2024.)

**Hypotheses**
Ref	Expression
dvle2.1	⊢ (𝜑 → 𝐴 ∈ ℝ)
dvle2.2	⊢ (𝜑 → 𝐵 ∈ ℝ)
dvle2.3	⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸) ∈ ((𝐴[,]𝐵)–cn→ℝ))
dvle2.4	⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺) ∈ ((𝐴[,]𝐵)–cn→ℝ))
dvle2.5	⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝐴(,)𝐵) ↦ 𝐸)) = (𝑥 ∈ (𝐴(,)𝐵) ↦ 𝐹))
dvle2.6	⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝐴(,)𝐵) ↦ 𝐺)) = (𝑥 ∈ (𝐴(,)𝐵) ↦ 𝐻))
dvle2.7	⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → 𝐹 ≤ 𝐻)
dvle2.8	⊢ (𝑥 = 𝐴 → 𝐸 = 𝑃)
dvle2.9	⊢ (𝑥 = 𝐴 → 𝐺 = 𝑄)
dvle2.10	⊢ (𝑥 = 𝐵 → 𝐸 = 𝑅)
dvle2.11	⊢ (𝑥 = 𝐵 → 𝐺 = 𝑆)
dvle2.12	⊢ (𝜑 → 𝑃 ≤ 𝑄)
dvle2.13	⊢ (𝜑 → 𝐴 ≤ 𝐵)

**Assertion**
Ref	Expression
dvle2	⊢ (𝜑 → 𝑅 ≤ 𝑆)

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 𝑥,𝑃 𝑥,𝑄 𝑥,𝑅 𝑥,𝑆 𝜑,𝑥 Allowed substitution hints: 𝐸(𝑥) 𝐹(𝑥) 𝐺(𝑥) 𝐻(𝑥)

**Proof of Theorem dvle2**
Step	Hyp	Ref	Expression
1		dvle2.10	. . . . . 6 ⊢ (𝑥 = 𝐵 → 𝐸 = 𝑅)
2	1	eleq1d 2850	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐸 ∈ ℝ ↔ 𝑅 ∈ ℝ))
3		dvle2.3	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸) ∈ ((𝐴[,]𝐵)–cn→ℝ))
4		cncff 25105	. . . . . . 7 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸) ∈ ((𝐴[,]𝐵)–cn→ℝ) → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸):(𝐴[,]𝐵)⟶ℝ)
5	3, 4	syl 18	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸):(𝐴[,]𝐵)⟶ℝ)
6		eqid 2765	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸) = (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸)
7	6	fmpt 7109	. . . . . 6 ⊢ (∀𝑥 ∈ (𝐴[,]𝐵)𝐸 ∈ ℝ ↔ (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸):(𝐴[,]𝐵)⟶ℝ)
8	5, 7	sylibr 237	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐵)𝐸 ∈ ℝ)
9		dvle2.2	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ)
10	9	rexrd 11276	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
11		dvle2.13	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
12	9	leidd 11797	. . . . . . 7 ⊢ (𝜑 → 𝐵 ≤ 𝐵)
13	10, 11, 12	3jca 1146	. . . . . 6 ⊢ (𝜑 → (𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐵))
14		dvle2.1	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ)
15	14	rexrd 11276	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
16		elicc1 13434	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐵 ∈ (𝐴[,]𝐵) ↔ (𝐵 ∈ ℝ^ ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐵)))
17	15, 10, 16	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (𝐵 ∈ (𝐴[,]𝐵) ↔ (𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐵)))
18	13, 17	mpbird 260	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ (𝐴[,]𝐵))
19	2, 8, 18	rspcdva 3584	. . . 4 ⊢ (𝜑 → 𝑅 ∈ ℝ)
20		dvle2.8	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐸 = 𝑃)
21	20	eleq1d 2850	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝐸 ∈ ℝ ↔ 𝑃 ∈ ℝ))
22	14	leidd 11797	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝐴)
23	15, 22, 11	3jca 1146	. . . . . 6 ⊢ (𝜑 → (𝐴 ∈ ℝ^* ∧ 𝐴 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵))
24		elicc1 13434	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐴 ∈ (𝐴[,]𝐵) ↔ (𝐴 ∈ ℝ^ ∧ 𝐴 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵)))
25	15, 10, 24	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (𝐴 ∈ (𝐴[,]𝐵) ↔ (𝐴 ∈ ℝ^* ∧ 𝐴 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵)))
26	23, 25	mpbird 260	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ (𝐴[,]𝐵))
27	21, 8, 26	rspcdva 3584	. . . 4 ⊢ (𝜑 → 𝑃 ∈ ℝ)
28	19, 27	resubcld 11659	. . 3 ⊢ (𝜑 → (𝑅 − 𝑃) ∈ ℝ)
29		dvle2.11	. . . . . 6 ⊢ (𝑥 = 𝐵 → 𝐺 = 𝑆)
30	29	eleq1d 2850	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐺 ∈ ℝ ↔ 𝑆 ∈ ℝ))
31		dvle2.4	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺) ∈ ((𝐴[,]𝐵)–cn→ℝ))
32		cncff 25105	. . . . . . 7 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺) ∈ ((𝐴[,]𝐵)–cn→ℝ) → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺):(𝐴[,]𝐵)⟶ℝ)
33	31, 32	syl 18	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺):(𝐴[,]𝐵)⟶ℝ)
34		eqid 2765	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺) = (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺)
35	34	fmpt 7109	. . . . . 6 ⊢ (∀𝑥 ∈ (𝐴[,]𝐵)𝐺 ∈ ℝ ↔ (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺):(𝐴[,]𝐵)⟶ℝ)
36	33, 35	sylibr 237	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐵)𝐺 ∈ ℝ)
37	30, 36, 18	rspcdva 3584	. . . 4 ⊢ (𝜑 → 𝑆 ∈ ℝ)
38		dvle2.9	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐺 = 𝑄)
39	38	eleq1d 2850	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝐺 ∈ ℝ ↔ 𝑄 ∈ ℝ))
40	39, 36, 26	rspcdva 3584	. . . 4 ⊢ (𝜑 → 𝑄 ∈ ℝ)
41	37, 40	resubcld 11659	. . 3 ⊢ (𝜑 → (𝑆 − 𝑄) ∈ ℝ)
42		dvle2.5	. . . 4 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝐴(,)𝐵) ↦ 𝐸)) = (𝑥 ∈ (𝐴(,)𝐵) ↦ 𝐹))
43		dvle2.6	. . . 4 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝐴(,)𝐵) ↦ 𝐺)) = (𝑥 ∈ (𝐴(,)𝐵) ↦ 𝐻))
44		dvle2.7	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → 𝐹 ≤ 𝐻)
45	14, 9, 3, 42, 31, 43, 44, 26, 18, 11, 20, 38, 1, 29	dvle 26219	. . 3 ⊢ (𝜑 → (𝑅 − 𝑃) ≤ (𝑆 − 𝑄))
46		dvle2.12	. . 3 ⊢ (𝜑 → 𝑃 ≤ 𝑄)
47	28, 27, 41, 40, 45, 46	le2addd 11850	. 2 ⊢ (𝜑 → ((𝑅 − 𝑃) + 𝑃) ≤ ((𝑆 − 𝑄) + 𝑄))
48	19	recnd 11254	. . . 4 ⊢ (𝜑 → 𝑅 ∈ ℂ)
49	27	recnd 11254	. . . 4 ⊢ (𝜑 → 𝑃 ∈ ℂ)
50	48, 49	npcand 11590	. . 3 ⊢ (𝜑 → ((𝑅 − 𝑃) + 𝑃) = 𝑅)
51	37	recnd 11254	. . . 4 ⊢ (𝜑 → 𝑆 ∈ ℂ)
52	40	recnd 11254	. . . 4 ⊢ (𝜑 → 𝑄 ∈ ℂ)
53	51, 52	npcand 11590	. . 3 ⊢ (𝜑 → ((𝑆 − 𝑄) + 𝑄) = 𝑆)
54	50, 53	breq12d 5124	. 2 ⊢ (𝜑 → (((𝑅 − 𝑃) + 𝑃) ≤ ((𝑆 − 𝑄) + 𝑄) ↔ 𝑅 ≤ 𝑆))
55	47, 54	mpbid 235	1 ⊢ (𝜑 → 𝑅 ≤ 𝑆)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∀wral 3081 class class class wbr 5111 ↦ cmpt 5194 ⟶wf 6536 (class class class)co 7419 ℝcr 11116 + caddc 11120 ℝ^*cxr 11259 ≤ cle 11261 − cmin 11458 (,)cioo 13390 [,]cicc 13393 –cn→ccncf 25088 D cdv 26075

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 ax-pre-sup 11195 ax-addf 11196

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-iin 4961 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7684 df-om 7869 df-1st 7992 df-2nd 7993 df-supp 8163 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-map 8832 df-pm 8833 df-ixp 8902 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fsupp 9329 df-fi 9378 df-sup 9409 df-inf 9410 df-oi 9479 df-card 9941 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-div 11889 df-nn 12251 df-2 12320 df-3 12321 df-4 12322 df-5 12323 df-6 12324 df-7 12325 df-8 12326 df-9 12327 df-n0 12522 df-z 12609 df-dec 12730 df-uz 12881 df-q 12991 df-rp 13035 df-xneg 13155 df-xadd 13156 df-xmul 13157 df-ioo 13394 df-ico 13396 df-icc 13397 df-fz 13554 df-fzo 13702 df-seq 14058 df-exp 14118 df-hash 14387 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-struct 17231 df-sets 17248 df-slot 17266 df-ndx 17278 df-base 17294 df-ress 17315 df-plusg 17347 df-mulr 17348 df-starv 17349 df-sca 17350 df-vsca 17351 df-ip 17352 df-tset 17353 df-ple 17354 df-ds 17356 df-unif 17357 df-hom 17358 df-cco 17359 df-rest 17499 df-topn 17500 df-0g 17518 df-gsum 17519 df-topgen 17520 df-pt 17521 df-prds 17524 df-xrs 17580 df-qtop 17585 df-imas 17586 df-xps 17588 df-mre 17662 df-mrc 17663 df-acs 17665 df-mgm 18722 df-sgrp 18811 df-mnd 18827 df-submnd 18881 df-mulg 19180 df-cntz 19433 df-cmn 19898 df-psmet 21566 df-xmet 21567 df-met 21568 df-bl 21569 df-mopn 21570 df-fbas 21571 df-fg 21572 df-cnfld 21575 df-top 23103 df-topon 23120 df-topsp 23142 df-bases 23155 df-cld 23228 df-ntr 23229 df-cls 23230 df-nei 23307 df-lp 23345 df-perf 23346 df-cn 23436 df-cnp 23437 df-haus 23524 df-cmp 23596 df-tx 23772 df-hmeo 23965 df-fil 24056 df-fm 24148 df-flim 24149 df-flf 24150 df-xms 24530 df-ms 24531 df-tms 24532 df-cncf 25090 df-limc 26078 df-dv 26079

This theorem is used by: aks4d1p1p5 42902

W3C validator