Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ivth | Structured version Visualization version GIF version |
Description: The intermediate value theorem, increasing case. This is Metamath 100 proof #79. (Contributed by Paul Chapman, 22-Jan-2008.) (Proof shortened by Mario Carneiro, 30-Apr-2014.) |
Ref | Expression |
---|---|
ivth.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
ivth.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
ivth.3 | ⊢ (𝜑 → 𝑈 ∈ ℝ) |
ivth.4 | ⊢ (𝜑 → 𝐴 < 𝐵) |
ivth.5 | ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ 𝐷) |
ivth.7 | ⊢ (𝜑 → 𝐹 ∈ (𝐷–cn→ℂ)) |
ivth.8 | ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℝ) |
ivth.9 | ⊢ (𝜑 → ((𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵))) |
Ref | Expression |
---|---|
ivth | ⊢ (𝜑 → ∃𝑐 ∈ (𝐴(,)𝐵)(𝐹‘𝑐) = 𝑈) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ivth.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
2 | ivth.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
3 | ivth.3 | . . 3 ⊢ (𝜑 → 𝑈 ∈ ℝ) | |
4 | ivth.4 | . . 3 ⊢ (𝜑 → 𝐴 < 𝐵) | |
5 | ivth.5 | . . 3 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ 𝐷) | |
6 | ivth.7 | . . 3 ⊢ (𝜑 → 𝐹 ∈ (𝐷–cn→ℂ)) | |
7 | ivth.8 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℝ) | |
8 | ivth.9 | . . 3 ⊢ (𝜑 → ((𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵))) | |
9 | fveq2 6191 | . . . . 5 ⊢ (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥)) | |
10 | 9 | breq1d 4663 | . . . 4 ⊢ (𝑦 = 𝑥 → ((𝐹‘𝑦) ≤ 𝑈 ↔ (𝐹‘𝑥) ≤ 𝑈)) |
11 | 10 | cbvrabv 3199 | . . 3 ⊢ {𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈} = {𝑥 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑥) ≤ 𝑈} |
12 | eqid 2622 | . . 3 ⊢ sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) = sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) | |
13 | 1, 2, 3, 4, 5, 6, 7, 8, 11, 12 | ivthlem3 23222 | . 2 ⊢ (𝜑 → (sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) ∈ (𝐴(,)𝐵) ∧ (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < )) = 𝑈)) |
14 | fveq2 6191 | . . . 4 ⊢ (𝑐 = sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) → (𝐹‘𝑐) = (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ))) | |
15 | 14 | eqeq1d 2624 | . . 3 ⊢ (𝑐 = sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) → ((𝐹‘𝑐) = 𝑈 ↔ (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < )) = 𝑈)) |
16 | 15 | rspcev 3309 | . 2 ⊢ ((sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) ∈ (𝐴(,)𝐵) ∧ (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < )) = 𝑈) → ∃𝑐 ∈ (𝐴(,)𝐵)(𝐹‘𝑐) = 𝑈) |
17 | 13, 16 | syl 17 | 1 ⊢ (𝜑 → ∃𝑐 ∈ (𝐴(,)𝐵)(𝐹‘𝑐) = 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∃wrex 2913 {crab 2916 ⊆ wss 3574 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 supcsup 8346 ℂcc 9934 ℝcr 9935 < clt 10074 ≤ cle 10075 (,)cioo 12175 [,]cicc 12178 –cn→ccncf 22679 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-sup 8348 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-rp 11833 df-ioo 12179 df-icc 12182 df-seq 12802 df-exp 12861 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-cncf 22681 |
This theorem is referenced by: ivth2 23224 ivthle 23225 reeff1olem 24200 signsply0 30628 |
Copyright terms: Public domain | W3C validator |