| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > stoweidlem5 | Structured version Visualization version GIF version | ||
| Description: There exists a δ as in the proof of Lemma 1 in [BrosowskiDeutsh] p. 90: 0 < δ < 1 , p >= δ on 𝑇 ∖ 𝑈. Here 𝐷 is used to represent δ in the paper and 𝑄 to represent 𝑇 ∖ 𝑈 in the paper. (Contributed by Glauco Siliprandi, 20-Apr-2017.) |
| Ref | Expression |
|---|---|
| stoweidlem5.1 | ⊢ Ⅎ𝑡𝜑 |
| stoweidlem5.2 | ⊢ 𝐷 = if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) |
| stoweidlem5.3 | ⊢ (𝜑 → 𝑃:𝑇⟶ℝ) |
| stoweidlem5.4 | ⊢ (𝜑 → 𝑄 ⊆ 𝑇) |
| stoweidlem5.5 | ⊢ (𝜑 → 𝐶 ∈ ℝ+) |
| stoweidlem5.6 | ⊢ (𝜑 → ∀𝑡 ∈ 𝑄 𝐶 ≤ (𝑃‘𝑡)) |
| Ref | Expression |
|---|---|
| stoweidlem5 | ⊢ (𝜑 → ∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ 𝑄 𝑑 ≤ (𝑃‘𝑡))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | stoweidlem5.2 | . . 3 ⊢ 𝐷 = if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) | |
| 2 | stoweidlem5.5 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ+) | |
| 3 | halfre 12599 | . . . . 5 ⊢ (1 / 2) ∈ ℝ | |
| 4 | halfgt0 12601 | . . . . 5 ⊢ 0 < (1 / 2) | |
| 5 | 3, 4 | elrpii 13163 | . . . 4 ⊢ (1 / 2) ∈ ℝ+ |
| 6 | ifcl 4531 | . . . 4 ⊢ ((𝐶 ∈ ℝ+ ∧ (1 / 2) ∈ ℝ+) → if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) ∈ ℝ+) | |
| 7 | 2, 5, 6 | sylancl 598 | . . 3 ⊢ (𝜑 → if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) ∈ ℝ+) |
| 8 | 1, 7 | eqeltrid 2868 | . 2 ⊢ (𝜑 → 𝐷 ∈ ℝ+) |
| 9 | 8 | rpred 13204 | . . 3 ⊢ (𝜑 → 𝐷 ∈ ℝ) |
| 10 | 3 | a1i 11 | . . 3 ⊢ (𝜑 → (1 / 2) ∈ ℝ) |
| 11 | 1red 11348 | . . 3 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 12 | 2 | rpred 13204 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 13 | min2 13360 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ (1 / 2) ∈ ℝ) → if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) ≤ (1 / 2)) | |
| 14 | 12, 3, 13 | sylancl 598 | . . . 4 ⊢ (𝜑 → if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) ≤ (1 / 2)) |
| 15 | 1, 14 | eqbrtrid 5146 | . . 3 ⊢ (𝜑 → 𝐷 ≤ (1 / 2)) |
| 16 | halflt1 12603 | . . . 4 ⊢ (1 / 2) < 1 | |
| 17 | 16 | a1i 11 | . . 3 ⊢ (𝜑 → (1 / 2) < 1) |
| 18 | 9, 10, 11, 15, 17 | lelttrd 11507 | . 2 ⊢ (𝜑 → 𝐷 < 1) |
| 19 | stoweidlem5.1 | . . 3 ⊢ Ⅎ𝑡𝜑 | |
| 20 | 7 | rpred 13204 | . . . . . . 7 ⊢ (𝜑 → if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) ∈ ℝ) |
| 21 | 20 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑄) → if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) ∈ ℝ) |
| 22 | 12 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑄) → 𝐶 ∈ ℝ) |
| 23 | stoweidlem5.3 | . . . . . . . 8 ⊢ (𝜑 → 𝑃:𝑇⟶ℝ) | |
| 24 | 23 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑄) → 𝑃:𝑇⟶ℝ) |
| 25 | stoweidlem5.4 | . . . . . . . 8 ⊢ (𝜑 → 𝑄 ⊆ 𝑇) | |
| 26 | 25 | sselda 3913 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑄) → 𝑡 ∈ 𝑇) |
| 27 | 24, 26 | ffvelcdmd 7117 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑄) → (𝑃‘𝑡) ∈ ℝ) |
| 28 | min1 13359 | . . . . . . . 8 ⊢ ((𝐶 ∈ ℝ ∧ (1 / 2) ∈ ℝ) → if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) ≤ 𝐶) | |
| 29 | 12, 3, 28 | sylancl 598 | . . . . . . 7 ⊢ (𝜑 → if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) ≤ 𝐶) |
| 30 | 29 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑄) → if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) ≤ 𝐶) |
| 31 | stoweidlem5.6 | . . . . . . 7 ⊢ (𝜑 → ∀𝑡 ∈ 𝑄 𝐶 ≤ (𝑃‘𝑡)) | |
| 32 | 31 | r19.21bi 3258 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑄) → 𝐶 ≤ (𝑃‘𝑡)) |
| 33 | 21, 22, 27, 30, 32 | letrd 11506 | . . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑄) → if(𝐶 ≤ (1 / 2), 𝐶, (1 / 2)) ≤ (𝑃‘𝑡)) |
| 34 | 1, 33 | eqbrtrid 5146 | . . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑄) → 𝐷 ≤ (𝑃‘𝑡)) |
| 35 | 34 | ex 418 | . . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑄 → 𝐷 ≤ (𝑃‘𝑡))) |
| 36 | 19, 35 | ralrimi 3264 | . 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝑄 𝐷 ≤ (𝑃‘𝑡)) |
| 37 | eleq1 2852 | . . . . 5 ⊢ (𝑑 = 𝐷 → (𝑑 ∈ ℝ+ ↔ 𝐷 ∈ ℝ+)) | |
| 38 | breq1 5111 | . . . . 5 ⊢ (𝑑 = 𝐷 → (𝑑 < 1 ↔ 𝐷 < 1)) | |
| 39 | breq1 5111 | . . . . . 6 ⊢ (𝑑 = 𝐷 → (𝑑 ≤ (𝑃‘𝑡) ↔ 𝐷 ≤ (𝑃‘𝑡))) | |
| 40 | 39 | ralbidv 3189 | . . . . 5 ⊢ (𝑑 = 𝐷 → (∀𝑡 ∈ 𝑄 𝑑 ≤ (𝑃‘𝑡) ↔ ∀𝑡 ∈ 𝑄 𝐷 ≤ (𝑃‘𝑡))) |
| 41 | 37, 38, 40 | 3anbi123d 1465 | . . . 4 ⊢ (𝑑 = 𝐷 → ((𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ 𝑄 𝑑 ≤ (𝑃‘𝑡)) ↔ (𝐷 ∈ ℝ+ ∧ 𝐷 < 1 ∧ ∀𝑡 ∈ 𝑄 𝐷 ≤ (𝑃‘𝑡)))) |
| 42 | 41 | spcegv 3555 | . . 3 ⊢ (𝐷 ∈ ℝ+ → ((𝐷 ∈ ℝ+ ∧ 𝐷 < 1 ∧ ∀𝑡 ∈ 𝑄 𝐷 ≤ (𝑃‘𝑡)) → ∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ 𝑄 𝑑 ≤ (𝑃‘𝑡)))) |
| 43 | 8, 42 | syl 18 | . 2 ⊢ (𝜑 → ((𝐷 ∈ ℝ+ ∧ 𝐷 < 1 ∧ ∀𝑡 ∈ 𝑄 𝐷 ≤ (𝑃‘𝑡)) → ∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ 𝑄 𝑑 ≤ (𝑃‘𝑡)))) |
| 44 | 8, 18, 36, 43 | mp3and 1494 | 1 ⊢ (𝜑 → ∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ 𝑄 𝑑 ≤ (𝑃‘𝑡))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 Ⅎwnf 1816 ∈ wcel 2147 ∀wral 3080 ⊆ wss 3900 ifcif 4485 class class class wbr 5108 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 ℝcr 11238 1c1 11240 < clt 11382 ≤ cle 11383 / cdiv 12013 2c2 12437 ℝ+crp 13160 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-rp 13161 |
| This theorem is used by: stoweidlem28 47372 |
| Copyright terms: Public domain | W3C validator |