| Mathbox for Jim Kingdon |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > repiecef | GIF version | ||
| Description: Piecewise definition on the reals yields a function. The function agrees with 𝐹 and 𝐺 on their respective parts of the real line; see repiecele0 16949 and repiecege0 16950. From an online post by James E Hanson. The construction was published in Martín Hötzel Escardó, "Effective and sequential definition by cases on the reals via infinite signed-digit numerals", Electronic Notes in Theoretical Computer Science 10 (1998), page 2, https://martinescardo.github.io/papers/lexnew.pdf. 16950 (Contributed by Jim Kingdon, 27-Apr-2026.) |
| Ref | Expression |
|---|---|
| repiece.f | ⊢ (𝜑 → 𝐹:(-∞(,]0)⟶ℝ) |
| repiece.g | ⊢ (𝜑 → 𝐺:(0[,)+∞)⟶ℝ) |
| repiece.0 | ⊢ (𝜑 → (𝐹‘0) = (𝐺‘0)) |
| repiece.h | ⊢ 𝐻 = (𝑥 ∈ ℝ ↦ (((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < ))) − (𝐹‘0))) |
| Ref | Expression |
|---|---|
| repiecef | ⊢ (𝜑 → 𝐻:ℝ⟶ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | repiece.f | . . . . 5 ⊢ (𝜑 → 𝐹:(-∞(,]0)⟶ℝ) | |
| 2 | repiece.g | . . . . 5 ⊢ (𝜑 → 𝐺:(0[,)+∞)⟶ℝ) | |
| 3 | repiece.0 | . . . . 5 ⊢ (𝜑 → (𝐹‘0) = (𝐺‘0)) | |
| 4 | repiece.h | . . . . 5 ⊢ 𝐻 = (𝑥 ∈ ℝ ↦ (((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < ))) − (𝐹‘0))) | |
| 5 | 1, 2, 3, 4 | repiecelem 16948 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ) |
| 6 | 5 | ralrimiva 2617 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ ℝ (((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ) |
| 7 | preq1 3773 | . . . . . . . . 9 ⊢ (𝑦 = 𝑥 → {𝑦, 0} = {𝑥, 0}) | |
| 8 | 7 | infeq1d 7316 | . . . . . . . 8 ⊢ (𝑦 = 𝑥 → inf({𝑦, 0}, ℝ, < ) = inf({𝑥, 0}, ℝ, < )) |
| 9 | 8 | fveq2d 5679 | . . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝐹‘inf({𝑦, 0}, ℝ, < )) = (𝐹‘inf({𝑥, 0}, ℝ, < ))) |
| 10 | 7 | supeq1d 7291 | . . . . . . . 8 ⊢ (𝑦 = 𝑥 → sup({𝑦, 0}, ℝ, < ) = sup({𝑥, 0}, ℝ, < )) |
| 11 | 10 | fveq2d 5679 | . . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝐺‘sup({𝑦, 0}, ℝ, < )) = (𝐺‘sup({𝑥, 0}, ℝ, < ))) |
| 12 | 9, 11 | oveq12d 6076 | . . . . . 6 ⊢ (𝑦 = 𝑥 → ((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) = ((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < )))) |
| 13 | 12 | oveq1d 6073 | . . . . 5 ⊢ (𝑦 = 𝑥 → (((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) = (((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < ))) − (𝐹‘0))) |
| 14 | 13 | eleq1d 2303 | . . . 4 ⊢ (𝑦 = 𝑥 → ((((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ ↔ (((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ)) |
| 15 | 14 | cbvralv 2780 | . . 3 ⊢ (∀𝑦 ∈ ℝ (((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ ↔ ∀𝑥 ∈ ℝ (((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ) |
| 16 | 6, 15 | sylib 122 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ (((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ) |
| 17 | 4 | fmpt 5832 | . 2 ⊢ (∀𝑥 ∈ ℝ (((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ ↔ 𝐻:ℝ⟶ℝ) |
| 18 | 16, 17 | sylib 122 | 1 ⊢ (𝜑 → 𝐻:ℝ⟶ℝ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2205 ∀wral 2522 {cpr 3695 ↦ cmpt 4176 ⟶wf 5353 ‘cfv 5357 (class class class)co 6058 supcsup 7286 infcinf 7287 ℝcr 8142 0cc0 8143 + caddc 8146 +∞cpnf 8321 -∞cmnf 8322 < clt 8324 − cmin 8461 (,]cioc 10244 [,)cico 10245 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-mulrcl 8242 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-precex 8253 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 ax-pre-mulgt0 8260 ax-pre-mulext 8261 ax-arch 8262 ax-caucvg 8263 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-po 4422 df-iso 4423 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-isom 5366 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-frec 6635 df-sup 7288 df-inf 7289 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8463 df-neg 8464 df-reap 8867 df-ap 8874 df-div 8967 df-inn 9258 df-2 9316 df-3 9317 df-4 9318 df-n0 9517 df-z 9598 df-uz 9875 df-rp 10008 df-ioc 10248 df-ico 10249 df-seqfrec 10837 df-exp 10928 df-cj 11555 df-re 11556 df-im 11557 df-rsqrt 11711 df-abs 11712 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |