| 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 8293 | . 2 ⊢ (𝑍 ∈ ℝ → (𝑍 + 1) ∈ ℝ) | |
| 3 | hover.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ sup({inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)}, ℝ, < )) | |
| 4 | preq1 3743 | . . . . . . 7 ⊢ (𝑥 = (𝑍 + 2) → {𝑥, 0} = {(𝑍 + 2), 0}) | |
| 5 | 4 | infeq1d 7190 | . . . . . 6 ⊢ (𝑥 = (𝑍 + 2) → inf({𝑥, 0}, ℝ, < ) = inf({(𝑍 + 2), 0}, ℝ, < )) |
| 6 | oveq1 6014 | . . . . . 6 ⊢ (𝑥 = (𝑍 + 2) → (𝑥 − 1) = ((𝑍 + 2) − 1)) | |
| 7 | 5, 6 | preq12d 3751 | . . . . 5 ⊢ (𝑥 = (𝑍 + 2) → {inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)} = {inf({(𝑍 + 2), 0}, ℝ, < ), ((𝑍 + 2) − 1)}) |
| 8 | 7 | supeq1d 7165 | . . . 4 ⊢ (𝑥 = (𝑍 + 2) → sup({inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)}, ℝ, < ) = sup({inf({(𝑍 + 2), 0}, ℝ, < ), ((𝑍 + 2) − 1)}, ℝ, < )) |
| 9 | 2re 9191 | . . . . . 6 ⊢ 2 ∈ ℝ | |
| 10 | 9 | a1i 9 | . . . . 5 ⊢ (𝑍 ∈ ℝ → 2 ∈ ℝ) |
| 11 | 1, 10 | readdcld 8187 | . . . 4 ⊢ (𝑍 ∈ ℝ → (𝑍 + 2) ∈ ℝ) |
| 12 | 0red 8158 | . . . . . 6 ⊢ (𝑍 ∈ ℝ → 0 ∈ ℝ) | |
| 13 | mincl 11757 | . . . . . 6 ⊢ (((𝑍 + 2) ∈ ℝ ∧ 0 ∈ ℝ) → inf({(𝑍 + 2), 0}, ℝ, < ) ∈ ℝ) | |
| 14 | 11, 12, 13 | syl2anc 411 | . . . . 5 ⊢ (𝑍 ∈ ℝ → inf({(𝑍 + 2), 0}, ℝ, < ) ∈ ℝ) |
| 15 | peano2rem 8424 | . . . . . 6 ⊢ ((𝑍 + 2) ∈ ℝ → ((𝑍 + 2) − 1) ∈ ℝ) | |
| 16 | 11, 15 | syl 14 | . . . . 5 ⊢ (𝑍 ∈ ℝ → ((𝑍 + 2) − 1) ∈ ℝ) |
| 17 | maxcl 11736 | . . . . 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 5730 | . . 3 ⊢ (𝑍 ∈ ℝ → (𝐹‘(𝑍 + 2)) = sup({inf({(𝑍 + 2), 0}, ℝ, < ), ((𝑍 + 2) − 1)}, ℝ, < )) |
| 20 | 19, 18 | eqeltrd 2306 | . 2 ⊢ (𝑍 ∈ ℝ → (𝐹‘(𝑍 + 2)) ∈ ℝ) |
| 21 | ltp1 9002 | . 2 ⊢ (𝑍 ∈ ℝ → 𝑍 < (𝑍 + 1)) | |
| 22 | recn 8143 | . . . . 5 ⊢ (𝑍 ∈ ℝ → 𝑍 ∈ ℂ) | |
| 23 | 2cnd 9194 | . . . . 5 ⊢ (𝑍 ∈ ℝ → 2 ∈ ℂ) | |
| 24 | 1cnd 8173 | . . . . 5 ⊢ (𝑍 ∈ ℝ → 1 ∈ ℂ) | |
| 25 | 22, 23, 24 | addsubassd 8488 | . . . 4 ⊢ (𝑍 ∈ ℝ → ((𝑍 + 2) − 1) = (𝑍 + (2 − 1))) |
| 26 | 2m1e1 9239 | . . . . 5 ⊢ (2 − 1) = 1 | |
| 27 | 26 | oveq2i 6018 | . . . 4 ⊢ (𝑍 + (2 − 1)) = (𝑍 + 1) |
| 28 | 25, 27 | eqtrdi 2278 | . . 3 ⊢ (𝑍 ∈ ℝ → ((𝑍 + 2) − 1) = (𝑍 + 1)) |
| 29 | maxle2 11738 | . . . . 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 4111 | . . 3 ⊢ (𝑍 ∈ ℝ → ((𝑍 + 2) − 1) ≤ (𝐹‘(𝑍 + 2))) |
| 32 | 28, 31 | eqbrtrrd 4107 | . 2 ⊢ (𝑍 ∈ ℝ → (𝑍 + 1) ≤ (𝐹‘(𝑍 + 2))) |
| 33 | 1, 2, 20, 21, 32 | ltletrd 8581 | 1 ⊢ (𝑍 ∈ ℝ → 𝑍 < (𝐹‘(𝑍 + 2))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 {cpr 3667 class class class wbr 4083 ↦ cmpt 4145 ‘cfv 5318 (class class class)co 6007 supcsup 7160 infcinf 7161 ℝcr 8009 0cc0 8010 1c1 8011 + caddc 8013 < clt 8192 ≤ cle 8193 − cmin 8328 2c2 9172 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-mulrcl 8109 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-precex 8120 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-apti 8125 ax-pre-ltadd 8126 ax-pre-mulgt0 8127 ax-pre-mulext 8128 ax-arch 8129 ax-caucvg 8130 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-isom 5327 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-frec 6543 df-sup 7162 df-inf 7163 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-reap 8733 df-ap 8740 df-div 8831 df-inn 9122 df-2 9180 df-3 9181 df-4 9182 df-n0 9381 df-z 9458 df-uz 9734 df-rp 9862 df-seqfrec 10682 df-exp 10773 df-cj 11368 df-re 11369 df-im 11370 df-rsqrt 11524 df-abs 11525 |
| This theorem is referenced by: ivthdichlem 15340 |
| Copyright terms: Public domain | W3C validator |