Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ivthlem1 | Structured version Visualization version GIF version |
Description: Lemma for ivth 24054. The set 𝑆 of all 𝑥 values with (𝐹‘𝑥) less than 𝑈 is lower bounded by 𝐴 and upper bounded by 𝐵. (Contributed by Mario Carneiro, 17-Jun-2014.) |
Ref | Expression |
---|---|
ivth.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
ivth.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
ivth.3 | ⊢ (𝜑 → 𝑈 ∈ ℝ) |
ivth.4 | ⊢ (𝜑 → 𝐴 < 𝐵) |
ivth.5 | ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ 𝐷) |
ivth.7 | ⊢ (𝜑 → 𝐹 ∈ (𝐷–cn→ℂ)) |
ivth.8 | ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℝ) |
ivth.9 | ⊢ (𝜑 → ((𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵))) |
ivth.10 | ⊢ 𝑆 = {𝑥 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑥) ≤ 𝑈} |
Ref | Expression |
---|---|
ivthlem1 | ⊢ (𝜑 → (𝐴 ∈ 𝑆 ∧ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ivth.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
2 | 1 | rexrd 10690 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
3 | ivth.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
4 | 3 | rexrd 10690 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
5 | ivth.4 | . . . . 5 ⊢ (𝜑 → 𝐴 < 𝐵) | |
6 | 1, 3, 5 | ltled 10787 | . . . 4 ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
7 | lbicc2 12851 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵)) | |
8 | 2, 4, 6, 7 | syl3anc 1367 | . . 3 ⊢ (𝜑 → 𝐴 ∈ (𝐴[,]𝐵)) |
9 | fveq2 6669 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝐹‘𝑥) = (𝐹‘𝐴)) | |
10 | 9 | eleq1d 2897 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) ∈ ℝ ↔ (𝐹‘𝐴) ∈ ℝ)) |
11 | ivth.8 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℝ) | |
12 | 11 | ralrimiva 3182 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐵)(𝐹‘𝑥) ∈ ℝ) |
13 | 10, 12, 8 | rspcdva 3624 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ ℝ) |
14 | ivth.3 | . . . 4 ⊢ (𝜑 → 𝑈 ∈ ℝ) | |
15 | ivth.9 | . . . . 5 ⊢ (𝜑 → ((𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵))) | |
16 | 15 | simpld 497 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) < 𝑈) |
17 | 13, 14, 16 | ltled 10787 | . . 3 ⊢ (𝜑 → (𝐹‘𝐴) ≤ 𝑈) |
18 | 9 | breq1d 5075 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) ≤ 𝑈 ↔ (𝐹‘𝐴) ≤ 𝑈)) |
19 | ivth.10 | . . . 4 ⊢ 𝑆 = {𝑥 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑥) ≤ 𝑈} | |
20 | 18, 19 | elrab2 3682 | . . 3 ⊢ (𝐴 ∈ 𝑆 ↔ (𝐴 ∈ (𝐴[,]𝐵) ∧ (𝐹‘𝐴) ≤ 𝑈)) |
21 | 8, 17, 20 | sylanbrc 585 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑆) |
22 | 19 | ssrab3 4056 | . . . . 5 ⊢ 𝑆 ⊆ (𝐴[,]𝐵) |
23 | 22 | sseli 3962 | . . . 4 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ (𝐴[,]𝐵)) |
24 | iccleub 12791 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑧 ∈ (𝐴[,]𝐵)) → 𝑧 ≤ 𝐵) | |
25 | 24 | 3expia 1117 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑧 ∈ (𝐴[,]𝐵) → 𝑧 ≤ 𝐵)) |
26 | 2, 4, 25 | syl2anc 586 | . . . 4 ⊢ (𝜑 → (𝑧 ∈ (𝐴[,]𝐵) → 𝑧 ≤ 𝐵)) |
27 | 23, 26 | syl5 34 | . . 3 ⊢ (𝜑 → (𝑧 ∈ 𝑆 → 𝑧 ≤ 𝐵)) |
28 | 27 | ralrimiv 3181 | . 2 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝐵) |
29 | 21, 28 | jca 514 | 1 ⊢ (𝜑 → (𝐴 ∈ 𝑆 ∧ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∀wral 3138 {crab 3142 ⊆ wss 3935 class class class wbr 5065 ‘cfv 6354 (class class class)co 7155 ℂcc 10534 ℝcr 10535 ℝ*cxr 10673 < clt 10674 ≤ cle 10675 [,]cicc 12740 –cn→ccncf 23483 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-pre-lttri 10610 ax-pre-lttrn 10611 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-po 5473 df-so 5474 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-ov 7158 df-oprab 7159 df-mpo 7160 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-icc 12744 |
This theorem is referenced by: ivthlem2 24052 ivthlem3 24053 |
Copyright terms: Public domain | W3C validator |