| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > hoverb | GIF version | ||
| Description: A point at which the hover function is greater than a given value. (Contributed by Jim Kingdon, 21-Jul-2025.) |
| Ref | Expression |
|---|---|
| hover.f | ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ sup({inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)}, ℝ, < )) |
| Ref | Expression |
|---|---|
| hoverb | ⊢ (𝑍 ∈ ℝ → 𝑍 < (𝐹‘(𝑍 + 2))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 19 | . 2 ⊢ (𝑍 ∈ ℝ → 𝑍 ∈ ℝ) | |
| 2 | peano2re 8314 | . 2 ⊢ (𝑍 ∈ ℝ → (𝑍 + 1) ∈ ℝ) | |
| 3 | hover.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ sup({inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)}, ℝ, < )) | |
| 4 | preq1 3748 | . . . . . . 7 ⊢ (𝑥 = (𝑍 + 2) → {𝑥, 0} = {(𝑍 + 2), 0}) | |
| 5 | 4 | infeq1d 7210 | . . . . . 6 ⊢ (𝑥 = (𝑍 + 2) → inf({𝑥, 0}, ℝ, < ) = inf({(𝑍 + 2), 0}, ℝ, < )) |
| 6 | oveq1 6024 | . . . . . 6 ⊢ (𝑥 = (𝑍 + 2) → (𝑥 − 1) = ((𝑍 + 2) − 1)) | |
| 7 | 5, 6 | preq12d 3756 | . . . . 5 ⊢ (𝑥 = (𝑍 + 2) → {inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)} = {inf({(𝑍 + 2), 0}, ℝ, < ), ((𝑍 + 2) − 1)}) |
| 8 | 7 | supeq1d 7185 | . . . 4 ⊢ (𝑥 = (𝑍 + 2) → sup({inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)}, ℝ, < ) = sup({inf({(𝑍 + 2), 0}, ℝ, < ), ((𝑍 + 2) − 1)}, ℝ, < )) |
| 9 | 2re 9212 | . . . . . 6 ⊢ 2 ∈ ℝ | |
| 10 | 9 | a1i 9 | . . . . 5 ⊢ (𝑍 ∈ ℝ → 2 ∈ ℝ) |
| 11 | 1, 10 | readdcld 8208 | . . . 4 ⊢ (𝑍 ∈ ℝ → (𝑍 + 2) ∈ ℝ) |
| 12 | 0red 8179 | . . . . . 6 ⊢ (𝑍 ∈ ℝ → 0 ∈ ℝ) | |
| 13 | mincl 11791 | . . . . . 6 ⊢ (((𝑍 + 2) ∈ ℝ ∧ 0 ∈ ℝ) → inf({(𝑍 + 2), 0}, ℝ, < ) ∈ ℝ) | |
| 14 | 11, 12, 13 | syl2anc 411 | . . . . 5 ⊢ (𝑍 ∈ ℝ → inf({(𝑍 + 2), 0}, ℝ, < ) ∈ ℝ) |
| 15 | peano2rem 8445 | . . . . . 6 ⊢ ((𝑍 + 2) ∈ ℝ → ((𝑍 + 2) − 1) ∈ ℝ) | |
| 16 | 11, 15 | syl 14 | . . . . 5 ⊢ (𝑍 ∈ ℝ → ((𝑍 + 2) − 1) ∈ ℝ) |
| 17 | maxcl 11770 | . . . . 5 ⊢ ((inf({(𝑍 + 2), 0}, ℝ, < ) ∈ ℝ ∧ ((𝑍 + 2) − 1) ∈ ℝ) → sup({inf({(𝑍 + 2), 0}, ℝ, < ), ((𝑍 + 2) − 1)}, ℝ, < ) ∈ ℝ) | |
| 18 | 14, 16, 17 | syl2anc 411 | . . . 4 ⊢ (𝑍 ∈ ℝ → sup({inf({(𝑍 + 2), 0}, ℝ, < ), ((𝑍 + 2) − 1)}, ℝ, < ) ∈ ℝ) |
| 19 | 3, 8, 11, 18 | fvmptd3 5740 | . . 3 ⊢ (𝑍 ∈ ℝ → (𝐹‘(𝑍 + 2)) = sup({inf({(𝑍 + 2), 0}, ℝ, < ), ((𝑍 + 2) − 1)}, ℝ, < )) |
| 20 | 19, 18 | eqeltrd 2308 | . 2 ⊢ (𝑍 ∈ ℝ → (𝐹‘(𝑍 + 2)) ∈ ℝ) |
| 21 | ltp1 9023 | . 2 ⊢ (𝑍 ∈ ℝ → 𝑍 < (𝑍 + 1)) | |
| 22 | recn 8164 | . . . . 5 ⊢ (𝑍 ∈ ℝ → 𝑍 ∈ ℂ) | |
| 23 | 2cnd 9215 | . . . . 5 ⊢ (𝑍 ∈ ℝ → 2 ∈ ℂ) | |
| 24 | 1cnd 8194 | . . . . 5 ⊢ (𝑍 ∈ ℝ → 1 ∈ ℂ) | |
| 25 | 22, 23, 24 | addsubassd 8509 | . . . 4 ⊢ (𝑍 ∈ ℝ → ((𝑍 + 2) − 1) = (𝑍 + (2 − 1))) |
| 26 | 2m1e1 9260 | . . . . 5 ⊢ (2 − 1) = 1 | |
| 27 | 26 | oveq2i 6028 | . . . 4 ⊢ (𝑍 + (2 − 1)) = (𝑍 + 1) |
| 28 | 25, 27 | eqtrdi 2280 | . . 3 ⊢ (𝑍 ∈ ℝ → ((𝑍 + 2) − 1) = (𝑍 + 1)) |
| 29 | maxle2 11772 | . . . . 5 ⊢ ((inf({(𝑍 + 2), 0}, ℝ, < ) ∈ ℝ ∧ ((𝑍 + 2) − 1) ∈ ℝ) → ((𝑍 + 2) − 1) ≤ sup({inf({(𝑍 + 2), 0}, ℝ, < ), ((𝑍 + 2) − 1)}, ℝ, < )) | |
| 30 | 14, 16, 29 | syl2anc 411 | . . . 4 ⊢ (𝑍 ∈ ℝ → ((𝑍 + 2) − 1) ≤ sup({inf({(𝑍 + 2), 0}, ℝ, < ), ((𝑍 + 2) − 1)}, ℝ, < )) |
| 31 | 30, 19 | breqtrrd 4116 | . . 3 ⊢ (𝑍 ∈ ℝ → ((𝑍 + 2) − 1) ≤ (𝐹‘(𝑍 + 2))) |
| 32 | 28, 31 | eqbrtrrd 4112 | . 2 ⊢ (𝑍 ∈ ℝ → (𝑍 + 1) ≤ (𝐹‘(𝑍 + 2))) |
| 33 | 1, 2, 20, 21, 32 | ltletrd 8602 | 1 ⊢ (𝑍 ∈ ℝ → 𝑍 < (𝐹‘(𝑍 + 2))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 {cpr 3670 class class class wbr 4088 ↦ cmpt 4150 ‘cfv 5326 (class class class)co 6017 supcsup 7180 infcinf 7181 ℝcr 8030 0cc0 8031 1c1 8032 + caddc 8034 < clt 8213 ≤ cle 8214 − cmin 8349 2c2 9193 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-mulrcl 8130 ax-addcom 8131 ax-mulcom 8132 ax-addass 8133 ax-mulass 8134 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-1rid 8138 ax-0id 8139 ax-rnegex 8140 ax-precex 8141 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 ax-pre-mulgt0 8148 ax-pre-mulext 8149 ax-arch 8150 ax-caucvg 8151 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-isom 5335 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-frec 6556 df-sup 7182 df-inf 7183 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-reap 8754 df-ap 8761 df-div 8852 df-inn 9143 df-2 9201 df-3 9202 df-4 9203 df-n0 9402 df-z 9479 df-uz 9755 df-rp 9888 df-seqfrec 10709 df-exp 10800 df-cj 11402 df-re 11403 df-im 11404 df-rsqrt 11558 df-abs 11559 |
| This theorem is referenced by: ivthdichlem 15374 |
| Copyright terms: Public domain | W3C validator |