| 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 6885 | . . . . 5 ⊢ (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥)) | |
| 10 | 9 | breq1d 5121 | . . . 4 ⊢ (𝑦 = 𝑥 → ((𝐹‘𝑦) ≤ 𝑈 ↔ (𝐹‘𝑥) ≤ 𝑈)) |
| 11 | 10 | cbvrabv 3428 | . . 3 ⊢ {𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈} = {𝑥 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑥) ≤ 𝑈} |
| 12 | eqid 2765 | . . 3 ⊢ sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) = sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) | |
| 13 | 1, 2, 3, 4, 5, 6, 7, 8, 11, 12 | ivthlem3 25663 | . 2 ⊢ (𝜑 → (sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) ∈ (𝐴(,)𝐵) ∧ (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < )) = 𝑈)) |
| 14 | fveqeq2 6894 | . . 3 ⊢ (𝑐 = sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) → ((𝐹‘𝑐) = 𝑈 ↔ (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < )) = 𝑈)) | |
| 15 | 14 | rspcev 3583 | . 2 ⊢ ((sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) ∈ (𝐴(,)𝐵) ∧ (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < )) = 𝑈) → ∃𝑐 ∈ (𝐴(,)𝐵)(𝐹‘𝑐) = 𝑈) |
| 16 | 13, 15 | syl 18 | 1 ⊢ (𝜑 → ∃𝑐 ∈ (𝐴(,)𝐵)(𝐹‘𝑐) = 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 {crab 3418 ⊆ wss 3906 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 supcsup 9407 ℂcc 11113 ℝcr 11114 < clt 11258 ≤ cle 11259 (,)cioo 13388 [,]cicc 13391 –cn→ccncf 25086 |
| 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-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 ax-pre-sup 11193 |
| 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-op 4598 df-uni 4875 df-iun 4960 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-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-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-map 8832 df-en 8950 df-dom 8951 df-sdom 8952 df-sup 9409 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-div 11887 df-nn 12249 df-2 12318 df-3 12319 df-n0 12520 df-z 12607 df-uz 12879 df-rp 13033 df-ioo 13392 df-icc 13395 df-seq 14056 df-exp 14116 df-cj 15174 df-re 15175 df-im 15176 df-sqrt 15310 df-abs 15311 df-cncf 25088 |
| This theorem is used by: ivth2 25665 ivthle 25666 reeff1olem 26660 signsply0 35003 |
| Copyright terms: Public domain | W3C validator |