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 42528

Description: Collapsed dvle 25987. (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 2822	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐸 ∈ ℝ ↔ 𝑅 ∈ ℝ))
3		dvle2.3	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸) ∈ ((𝐴[,]𝐵)–cn→ℝ))
4		cncff 24873	. . . . . . 7 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸) ∈ ((𝐴[,]𝐵)–cn→ℝ) → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸):(𝐴[,]𝐵)⟶ℝ)
5	3, 4	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸):(𝐴[,]𝐵)⟶ℝ)
6		eqid 2737	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸) = (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸)
7	6	fmpt 7057	. . . . . 6 ⊢ (∀𝑥 ∈ (𝐴[,]𝐵)𝐸 ∈ ℝ ↔ (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐸):(𝐴[,]𝐵)⟶ℝ)
8	5, 7	sylibr 234	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐵)𝐸 ∈ ℝ)
9		dvle2.2	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ)
10	9	rexrd 11189	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
11		dvle2.13	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
12	9	leidd 11710	. . . . . . 7 ⊢ (𝜑 → 𝐵 ≤ 𝐵)
13	10, 11, 12	3jca 1129	. . . . . 6 ⊢ (𝜑 → (𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐵))
14		dvle2.1	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ)
15	14	rexrd 11189	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
16		elicc1 13336	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐵 ∈ (𝐴[,]𝐵) ↔ (𝐵 ∈ ℝ^ ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐵)))
17	15, 10, 16	syl2anc 585	. . . . . 6 ⊢ (𝜑 → (𝐵 ∈ (𝐴[,]𝐵) ↔ (𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐵)))
18	13, 17	mpbird 257	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ (𝐴[,]𝐵))
19	2, 8, 18	rspcdva 3566	. . . 4 ⊢ (𝜑 → 𝑅 ∈ ℝ)
20		dvle2.8	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐸 = 𝑃)
21	20	eleq1d 2822	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝐸 ∈ ℝ ↔ 𝑃 ∈ ℝ))
22	14	leidd 11710	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝐴)
23	15, 22, 11	3jca 1129	. . . . . 6 ⊢ (𝜑 → (𝐴 ∈ ℝ^* ∧ 𝐴 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵))
24		elicc1 13336	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐴 ∈ (𝐴[,]𝐵) ↔ (𝐴 ∈ ℝ^ ∧ 𝐴 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵)))
25	15, 10, 24	syl2anc 585	. . . . . 6 ⊢ (𝜑 → (𝐴 ∈ (𝐴[,]𝐵) ↔ (𝐴 ∈ ℝ^* ∧ 𝐴 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵)))
26	23, 25	mpbird 257	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ (𝐴[,]𝐵))
27	21, 8, 26	rspcdva 3566	. . . 4 ⊢ (𝜑 → 𝑃 ∈ ℝ)
28	19, 27	resubcld 11572	. . 3 ⊢ (𝜑 → (𝑅 − 𝑃) ∈ ℝ)
29		dvle2.11	. . . . . 6 ⊢ (𝑥 = 𝐵 → 𝐺 = 𝑆)
30	29	eleq1d 2822	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐺 ∈ ℝ ↔ 𝑆 ∈ ℝ))
31		dvle2.4	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺) ∈ ((𝐴[,]𝐵)–cn→ℝ))
32		cncff 24873	. . . . . . 7 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺) ∈ ((𝐴[,]𝐵)–cn→ℝ) → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺):(𝐴[,]𝐵)⟶ℝ)
33	31, 32	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺):(𝐴[,]𝐵)⟶ℝ)
34		eqid 2737	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺) = (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺)
35	34	fmpt 7057	. . . . . 6 ⊢ (∀𝑥 ∈ (𝐴[,]𝐵)𝐺 ∈ ℝ ↔ (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐺):(𝐴[,]𝐵)⟶ℝ)
36	33, 35	sylibr 234	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐵)𝐺 ∈ ℝ)
37	30, 36, 18	rspcdva 3566	. . . 4 ⊢ (𝜑 → 𝑆 ∈ ℝ)
38		dvle2.9	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐺 = 𝑄)
39	38	eleq1d 2822	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝐺 ∈ ℝ ↔ 𝑄 ∈ ℝ))
40	39, 36, 26	rspcdva 3566	. . . 4 ⊢ (𝜑 → 𝑄 ∈ ℝ)
41	37, 40	resubcld 11572	. . 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 25987	. . 3 ⊢ (𝜑 → (𝑅 − 𝑃) ≤ (𝑆 − 𝑄))
46		dvle2.12	. . 3 ⊢ (𝜑 → 𝑃 ≤ 𝑄)
47	28, 27, 41, 40, 45, 46	le2addd 11763	. 2 ⊢ (𝜑 → ((𝑅 − 𝑃) + 𝑃) ≤ ((𝑆 − 𝑄) + 𝑄))
48	19	recnd 11167	. . . 4 ⊢ (𝜑 → 𝑅 ∈ ℂ)
49	27	recnd 11167	. . . 4 ⊢ (𝜑 → 𝑃 ∈ ℂ)
50	48, 49	npcand 11503	. . 3 ⊢ (𝜑 → ((𝑅 − 𝑃) + 𝑃) = 𝑅)
51	37	recnd 11167	. . . 4 ⊢ (𝜑 → 𝑆 ∈ ℂ)
52	40	recnd 11167	. . . 4 ⊢ (𝜑 → 𝑄 ∈ ℂ)
53	51, 52	npcand 11503	. . 3 ⊢ (𝜑 → ((𝑆 − 𝑄) + 𝑄) = 𝑆)
54	50, 53	breq12d 5099	. 2 ⊢ (𝜑 → (((𝑅 − 𝑃) + 𝑃) ≤ ((𝑆 − 𝑄) + 𝑄) ↔ 𝑅 ≤ 𝑆))
55	47, 54	mpbid 232	1 ⊢ (𝜑 → 𝑅 ≤ 𝑆)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 class class class wbr 5086 ↦ cmpt 5167 ⟶wf 6489 (class class class)co 7361 ℝcr 11031 + caddc 11035 ℝ^*cxr 11172 ≤ cle 11174 − cmin 11371 (,)cioo 13292 [,]cicc 13295 –cn→ccncf 24856 D cdv 25843

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 ax-pre-sup 11110 ax-addf 11111

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-of 7625 df-om 7812 df-1st 7936 df-2nd 7937 df-supp 8105 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-er 8637 df-map 8769 df-pm 8770 df-ixp 8840 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-fsupp 9269 df-fi 9318 df-sup 9349 df-inf 9350 df-oi 9419 df-card 9857 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-div 11802 df-nn 12169 df-2 12238 df-3 12239 df-4 12240 df-5 12241 df-6 12242 df-7 12243 df-8 12244 df-9 12245 df-n0 12432 df-z 12519 df-dec 12639 df-uz 12783 df-q 12893 df-rp 12937 df-xneg 13057 df-xadd 13058 df-xmul 13059 df-ioo 13296 df-ico 13298 df-icc 13299 df-fz 13456 df-fzo 13603 df-seq 13958 df-exp 14018 df-hash 14287 df-cj 15055 df-re 15056 df-im 15057 df-sqrt 15191 df-abs 15192 df-struct 17111 df-sets 17128 df-slot 17146 df-ndx 17158 df-base 17174 df-ress 17195 df-plusg 17227 df-mulr 17228 df-starv 17229 df-sca 17230 df-vsca 17231 df-ip 17232 df-tset 17233 df-ple 17234 df-ds 17236 df-unif 17237 df-hom 17238 df-cco 17239 df-rest 17379 df-topn 17380 df-0g 17398 df-gsum 17399 df-topgen 17400 df-pt 17401 df-prds 17404 df-xrs 17460 df-qtop 17465 df-imas 17466 df-xps 17468 df-mre 17542 df-mrc 17543 df-acs 17545 df-mgm 18602 df-sgrp 18681 df-mnd 18697 df-submnd 18746 df-mulg 19038 df-cntz 19286 df-cmn 19751 df-psmet 21339 df-xmet 21340 df-met 21341 df-bl 21342 df-mopn 21343 df-fbas 21344 df-fg 21345 df-cnfld 21348 df-top 22872 df-topon 22889 df-topsp 22911 df-bases 22924 df-cld 22997 df-ntr 22998 df-cls 22999 df-nei 23076 df-lp 23114 df-perf 23115 df-cn 23205 df-cnp 23206 df-haus 23293 df-cmp 23365 df-tx 23540 df-hmeo 23733 df-fil 23824 df-fm 23916 df-flim 23917 df-flf 23918 df-xms 24298 df-ms 24299 df-tms 24300 df-cncf 24858 df-limc 25846 df-dv 25847

This theorem is referenced by: aks4d1p1p5 42531

W3C validator