| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > hovera | GIF version | ||
| Description: A point at which the hover function is less than a given value. (Contributed by Jim Kingdon, 21-Jul-2025.) |
| Ref | Expression |
|---|---|
| hover.f | ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ sup({inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)}, ℝ, < )) |
| Ref | Expression |
|---|---|
| hovera | ⊢ (𝑍 ∈ ℝ → (𝐹‘(𝑍 − 1)) < 𝑍) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hover.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ sup({inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)}, ℝ, < )) | |
| 2 | preq1 3788 | . . . . . 6 ⊢ (𝑥 = (𝑍 − 1) → {𝑥, 0} = {(𝑍 − 1), 0}) | |
| 3 | 2 | infeq1d 7358 | . . . . 5 ⊢ (𝑥 = (𝑍 − 1) → inf({𝑥, 0}, ℝ, < ) = inf({(𝑍 − 1), 0}, ℝ, < )) |
| 4 | oveq1 6095 | . . . . 5 ⊢ (𝑥 = (𝑍 − 1) → (𝑥 − 1) = ((𝑍 − 1) − 1)) | |
| 5 | 3, 4 | preq12d 3796 | . . . 4 ⊢ (𝑥 = (𝑍 − 1) → {inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)} = {inf({(𝑍 − 1), 0}, ℝ, < ), ((𝑍 − 1) − 1)}) |
| 6 | 5 | supeq1d 7333 | . . 3 ⊢ (𝑥 = (𝑍 − 1) → sup({inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)}, ℝ, < ) = sup({inf({(𝑍 − 1), 0}, ℝ, < ), ((𝑍 − 1) − 1)}, ℝ, < )) |
| 7 | peano2rem 8600 | . . 3 ⊢ (𝑍 ∈ ℝ → (𝑍 − 1) ∈ ℝ) | |
| 8 | 0red 8333 | . . . . 5 ⊢ (𝑍 ∈ ℝ → 0 ∈ ℝ) | |
| 9 | mincl 12021 | . . . . 5 ⊢ (((𝑍 − 1) ∈ ℝ ∧ 0 ∈ ℝ) → inf({(𝑍 − 1), 0}, ℝ, < ) ∈ ℝ) | |
| 10 | 7, 8, 9 | syl2anc 415 | . . . 4 ⊢ (𝑍 ∈ ℝ → inf({(𝑍 − 1), 0}, ℝ, < ) ∈ ℝ) |
| 11 | peano2rem 8600 | . . . . 5 ⊢ ((𝑍 − 1) ∈ ℝ → ((𝑍 − 1) − 1) ∈ ℝ) | |
| 12 | 7, 11 | syl 14 | . . . 4 ⊢ (𝑍 ∈ ℝ → ((𝑍 − 1) − 1) ∈ ℝ) |
| 13 | maxcl 11999 | . . . 4 ⊢ ((inf({(𝑍 − 1), 0}, ℝ, < ) ∈ ℝ ∧ ((𝑍 − 1) − 1) ∈ ℝ) → sup({inf({(𝑍 − 1), 0}, ℝ, < ), ((𝑍 − 1) − 1)}, ℝ, < ) ∈ ℝ) | |
| 14 | 10, 12, 13 | syl2anc 415 | . . 3 ⊢ (𝑍 ∈ ℝ → sup({inf({(𝑍 − 1), 0}, ℝ, < ), ((𝑍 − 1) − 1)}, ℝ, < ) ∈ ℝ) |
| 15 | 1, 6, 7, 14 | fvmptd3 5802 | . 2 ⊢ (𝑍 ∈ ℝ → (𝐹‘(𝑍 − 1)) = sup({inf({(𝑍 − 1), 0}, ℝ, < ), ((𝑍 − 1) − 1)}, ℝ, < )) |
| 16 | id 19 | . . . 4 ⊢ (𝑍 ∈ ℝ → 𝑍 ∈ ℝ) | |
| 17 | 0re 8332 | . . . . 5 ⊢ 0 ∈ ℝ | |
| 18 | min1inf 12022 | . . . . 5 ⊢ (((𝑍 − 1) ∈ ℝ ∧ 0 ∈ ℝ) → inf({(𝑍 − 1), 0}, ℝ, < ) ≤ (𝑍 − 1)) | |
| 19 | 7, 17, 18 | sylancl 417 | . . . 4 ⊢ (𝑍 ∈ ℝ → inf({(𝑍 − 1), 0}, ℝ, < ) ≤ (𝑍 − 1)) |
| 20 | ltm1 9184 | . . . 4 ⊢ (𝑍 ∈ ℝ → (𝑍 − 1) < 𝑍) | |
| 21 | 10, 7, 16, 19, 20 | lelttrd 8458 | . . 3 ⊢ (𝑍 ∈ ℝ → inf({(𝑍 − 1), 0}, ℝ, < ) < 𝑍) |
| 22 | 7 | ltm1d 9270 | . . . 4 ⊢ (𝑍 ∈ ℝ → ((𝑍 − 1) − 1) < (𝑍 − 1)) |
| 23 | 12, 7, 16, 22, 20 | lttrd 8459 | . . 3 ⊢ (𝑍 ∈ ℝ → ((𝑍 − 1) − 1) < 𝑍) |
| 24 | maxltsup 12007 | . . . 4 ⊢ ((inf({(𝑍 − 1), 0}, ℝ, < ) ∈ ℝ ∧ ((𝑍 − 1) − 1) ∈ ℝ ∧ 𝑍 ∈ ℝ) → (sup({inf({(𝑍 − 1), 0}, ℝ, < ), ((𝑍 − 1) − 1)}, ℝ, < ) < 𝑍 ↔ (inf({(𝑍 − 1), 0}, ℝ, < ) < 𝑍 ∧ ((𝑍 − 1) − 1) < 𝑍))) | |
| 25 | 10, 12, 16, 24 | syl3anc 1278 | . . 3 ⊢ (𝑍 ∈ ℝ → (sup({inf({(𝑍 − 1), 0}, ℝ, < ), ((𝑍 − 1) − 1)}, ℝ, < ) < 𝑍 ↔ (inf({(𝑍 − 1), 0}, ℝ, < ) < 𝑍 ∧ ((𝑍 − 1) − 1) < 𝑍))) |
| 26 | 21, 23, 25 | mpbir2and 957 | . 2 ⊢ (𝑍 ∈ ℝ → sup({inf({(𝑍 − 1), 0}, ℝ, < ), ((𝑍 − 1) − 1)}, ℝ, < ) < 𝑍) |
| 27 | 15, 26 | eqbrtrd 4153 | 1 ⊢ (𝑍 ∈ ℝ → (𝐹‘(𝑍 − 1)) < 𝑍) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 {cpr 3710 class class class wbr 4131 ↦ cmpt 4193 ‘cfv 5380 (class class class)co 6088 supcsup 7328 infcinf 7329 ℝcr 8184 0cc0 8185 1c1 8186 < clt 8366 ≤ cle 8367 − cmin 8504 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-mulrcl 8284 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-precex 8295 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 ax-pre-mulgt0 8302 ax-pre-mulext 8303 ax-arch 8304 ax-caucvg 8305 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-isom 5389 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-frec 6666 df-sup 7330 df-inf 7331 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-reap 8911 df-ap 8918 df-div 9011 df-inn 9314 df-2 9372 df-3 9373 df-4 9374 df-n0 9575 df-z 9656 df-uz 9938 df-rp 10072 df-seqfrec 10906 df-exp 10997 df-cj 11629 df-re 11630 df-im 11631 df-rsqrt 11786 df-abs 11787 |
| This theorem is used by: ivthdichlem 15877 |
| Copyright terms: Public domain | W3C validator |