| 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 16859 and repiecege0 16860. 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. 16860 (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 16858 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ) |
| 6 | 5 | ralrimiva 2617 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ ℝ (((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ) |
| 7 | preq1 3770 | . . . . . . . . 9 ⊢ (𝑦 = 𝑥 → {𝑦, 0} = {𝑥, 0}) | |
| 8 | 7 | infeq1d 7305 | . . . . . . . 8 ⊢ (𝑦 = 𝑥 → inf({𝑦, 0}, ℝ, < ) = inf({𝑥, 0}, ℝ, < )) |
| 9 | 8 | fveq2d 5676 | . . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝐹‘inf({𝑦, 0}, ℝ, < )) = (𝐹‘inf({𝑥, 0}, ℝ, < ))) |
| 10 | 7 | supeq1d 7280 | . . . . . . . 8 ⊢ (𝑦 = 𝑥 → sup({𝑦, 0}, ℝ, < ) = sup({𝑥, 0}, ℝ, < )) |
| 11 | 10 | fveq2d 5676 | . . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝐺‘sup({𝑦, 0}, ℝ, < )) = (𝐺‘sup({𝑥, 0}, ℝ, < ))) |
| 12 | 9, 11 | oveq12d 6070 | . . . . . 6 ⊢ (𝑦 = 𝑥 → ((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) = ((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < )))) |
| 13 | 12 | oveq1d 6067 | . . . . 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 5829 | . 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 3692 ↦ cmpt 4173 ⟶wf 5350 ‘cfv 5354 (class class class)co 6052 supcsup 7275 infcinf 7276 ℝcr 8131 0cc0 8132 + caddc 8135 +∞cpnf 8310 -∞cmnf 8311 < clt 8313 − cmin 8449 (,]cioc 10228 [,)cico 10229 |
| 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 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-mulrcl 8231 ax-addcom 8232 ax-mulcom 8233 ax-addass 8234 ax-mulass 8235 ax-distr 8236 ax-i2m1 8237 ax-0lt1 8238 ax-1rid 8239 ax-0id 8240 ax-rnegex 8241 ax-precex 8242 ax-cnre 8243 ax-pre-ltirr 8244 ax-pre-ltwlin 8245 ax-pre-lttrn 8246 ax-pre-apti 8247 ax-pre-ltadd 8248 ax-pre-mulgt0 8249 ax-pre-mulext 8250 ax-arch 8251 ax-caucvg 8252 |
| 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 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-po 4419 df-iso 4420 df-iord 4489 df-on 4491 df-ilim 4492 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-isom 5363 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-recs 6538 df-frec 6624 df-sup 7277 df-inf 7278 df-pnf 8315 df-mnf 8316 df-xr 8317 df-ltxr 8318 df-le 8319 df-sub 8451 df-neg 8452 df-reap 8854 df-ap 8861 df-div 8952 df-inn 9243 df-2 9301 df-3 9302 df-4 9303 df-n0 9502 df-z 9583 df-uz 9860 df-rp 9993 df-ioc 10232 df-ico 10233 df-seqfrec 10817 df-exp 10908 df-cj 11535 df-re 11536 df-im 11537 df-rsqrt 11691 df-abs 11692 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |