dvivthlem2 - Metamath Proof Explorer

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

Theorem dvivthlem2 25078

Description: Lemma for dvivth 25079. (Contributed by Mario Carneiro, 20-Feb-2015.)

**Hypotheses**
Ref	Expression
dvivth.1	⊢ (𝜑 → 𝑀 ∈ (𝐴(,)𝐵))
dvivth.2	⊢ (𝜑 → 𝑁 ∈ (𝐴(,)𝐵))
dvivth.3	⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℝ))
dvivth.4	⊢ (𝜑 → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
dvivth.5	⊢ (𝜑 → 𝑀 < 𝑁)
dvivth.6	⊢ (𝜑 → 𝐶 ∈ (((ℝ D 𝐹)‘𝑁)[,]((ℝ D 𝐹)‘𝑀)))
dvivth.7	⊢ 𝐺 = (𝑦 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘𝑦) − (𝐶 · 𝑦)))

**Assertion**
Ref	Expression
dvivthlem2	⊢ (𝜑 → 𝐶 ∈ ran (ℝ D 𝐹))

Distinct variable groups: 𝑦,𝐴 𝑦,𝐵 𝑦,𝐹 𝑦,𝑀 𝑦,𝐶 𝑦,𝑁 𝜑,𝑦 Allowed substitution hint: 𝐺(𝑦)

Proof of Theorem dvivthlem2 Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dvivth.1	. . 3 ⊢ (𝜑 → 𝑀 ∈ (𝐴(,)𝐵))
2		dvivth.2	. . 3 ⊢ (𝜑 → 𝑁 ∈ (𝐴(,)𝐵))
3		dvivth.3	. . 3 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℝ))
4		dvivth.4	. . 3 ⊢ (𝜑 → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
5		dvivth.5	. . 3 ⊢ (𝜑 → 𝑀 < 𝑁)
6		dvivth.6	. . 3 ⊢ (𝜑 → 𝐶 ∈ (((ℝ D 𝐹)‘𝑁)[,]((ℝ D 𝐹)‘𝑀)))
7		dvivth.7	. . 3 ⊢ 𝐺 = (𝑦 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘𝑦) − (𝐶 · 𝑦)))
8	1, 2, 3, 4, 5, 6, 7	dvivthlem1 25077	. 2 ⊢ (𝜑 → ∃𝑥 ∈ (𝑀[,]𝑁)((ℝ D 𝐹)‘𝑥) = 𝐶)
9		dvf 24976	. . . . . . 7 ⊢ (ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℂ
10	4	feq2d 6570	. . . . . . 7 ⊢ (𝜑 → ((ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℂ ↔ (ℝ D 𝐹):(𝐴(,)𝐵)⟶ℂ))
11	9, 10	mpbii 232	. . . . . 6 ⊢ (𝜑 → (ℝ D 𝐹):(𝐴(,)𝐵)⟶ℂ)
12	11	ffnd 6585	. . . . 5 ⊢ (𝜑 → (ℝ D 𝐹) Fn (𝐴(,)𝐵))
13		iccssioo2 13081	. . . . . . 7 ⊢ ((𝑀 ∈ (𝐴(,)𝐵) ∧ 𝑁 ∈ (𝐴(,)𝐵)) → (𝑀[,]𝑁) ⊆ (𝐴(,)𝐵))
14	1, 2, 13	syl2anc 583	. . . . . 6 ⊢ (𝜑 → (𝑀[,]𝑁) ⊆ (𝐴(,)𝐵))
15	14	sselda 3917	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → 𝑥 ∈ (𝐴(,)𝐵))
16		fnfvelrn 6940	. . . . 5 ⊢ (((ℝ D 𝐹) Fn (𝐴(,)𝐵) ∧ 𝑥 ∈ (𝐴(,)𝐵)) → ((ℝ D 𝐹)‘𝑥) ∈ ran (ℝ D 𝐹))
17	12, 15, 16	syl2an2r 681	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → ((ℝ D 𝐹)‘𝑥) ∈ ran (ℝ D 𝐹))
18		eleq1 2826	. . . 4 ⊢ (((ℝ D 𝐹)‘𝑥) = 𝐶 → (((ℝ D 𝐹)‘𝑥) ∈ ran (ℝ D 𝐹) ↔ 𝐶 ∈ ran (ℝ D 𝐹)))
19	17, 18	syl5ibcom 244	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀[,]𝑁)) → (((ℝ D 𝐹)‘𝑥) = 𝐶 → 𝐶 ∈ ran (ℝ D 𝐹)))
20	19	rexlimdva 3212	. 2 ⊢ (𝜑 → (∃𝑥 ∈ (𝑀[,]𝑁)((ℝ D 𝐹)‘𝑥) = 𝐶 → 𝐶 ∈ ran (ℝ D 𝐹)))
21	8, 20	mpd 15	1 ⊢ (𝜑 → 𝐶 ∈ ran (ℝ D 𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∃wrex 3064 ⊆ wss 3883 class class class wbr 5070 ↦ cmpt 5153 dom cdm 5580 ran crn 5581 Fn wfn 6413 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ℝcr 10801 · cmul 10807 < clt 10940 − cmin 11135 (,)cioo 13008 [,]cicc 13011 –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: dvivth 25079

W3C validator