![]() |
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 6103 | . . . . 5 ⊢ (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥)) | |
10 | 9 | breq1d 4593 | . . . 4 ⊢ (𝑦 = 𝑥 → ((𝐹‘𝑦) ≤ 𝑈 ↔ (𝐹‘𝑥) ≤ 𝑈)) |
11 | 10 | cbvrabv 3172 | . . 3 ⊢ {𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈} = {𝑥 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑥) ≤ 𝑈} |
12 | eqid 2610 | . . 3 ⊢ sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) = sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) | |
13 | 1, 2, 3, 4, 5, 6, 7, 8, 11, 12 | ivthlem3 23029 | . 2 ⊢ (𝜑 → (sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) ∈ (𝐴(,)𝐵) ∧ (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < )) = 𝑈)) |
14 | fveq2 6103 | . . . 4 ⊢ (𝑐 = sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) → (𝐹‘𝑐) = (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ))) | |
15 | 14 | eqeq1d 2612 | . . 3 ⊢ (𝑐 = sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) → ((𝐹‘𝑐) = 𝑈 ↔ (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < )) = 𝑈)) |
16 | 15 | rspcev 3282 | . 2 ⊢ ((sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < ) ∈ (𝐴(,)𝐵) ∧ (𝐹‘sup({𝑦 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑦) ≤ 𝑈}, ℝ, < )) = 𝑈) → ∃𝑐 ∈ (𝐴(,)𝐵)(𝐹‘𝑐) = 𝑈) |
17 | 13, 16 | syl 17 | 1 ⊢ (𝜑 → ∃𝑐 ∈ (𝐴(,)𝐵)(𝐹‘𝑐) = 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∃wrex 2897 {crab 2900 ⊆ wss 3540 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 supcsup 8229 ℂcc 9813 ℝcr 9814 < clt 9953 ≤ cle 9954 (,)cioo 12046 [,]cicc 12049 –cn→ccncf 22487 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-map 7746 df-en 7842 df-dom 7843 df-sdom 7844 df-sup 8231 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-ioo 12050 df-icc 12053 df-seq 12664 df-exp 12723 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-cncf 22489 |
This theorem is referenced by: ivth2 23031 ivthle 23032 reeff1olem 24004 signsply0 29954 |
Copyright terms: Public domain | W3C validator |