| 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 17049 and repiecege0 17050. 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. 17050 (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 17048 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ) |
| 6 | 5 | ralrimiva 2623 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ ℝ (((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ) |
| 7 | preq1 3787 | . . . . . . . . 9 ⊢ (𝑦 = 𝑥 → {𝑦, 0} = {𝑥, 0}) | |
| 8 | 7 | infeq1d 7346 | . . . . . . . 8 ⊢ (𝑦 = 𝑥 → inf({𝑦, 0}, ℝ, < ) = inf({𝑥, 0}, ℝ, < )) |
| 9 | 8 | fveq2d 5697 | . . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝐹‘inf({𝑦, 0}, ℝ, < )) = (𝐹‘inf({𝑥, 0}, ℝ, < ))) |
| 10 | 7 | supeq1d 7321 | . . . . . . . 8 ⊢ (𝑦 = 𝑥 → sup({𝑦, 0}, ℝ, < ) = sup({𝑥, 0}, ℝ, < )) |
| 11 | 10 | fveq2d 5697 | . . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝐺‘sup({𝑦, 0}, ℝ, < )) = (𝐺‘sup({𝑥, 0}, ℝ, < ))) |
| 12 | 9, 11 | oveq12d 6097 | . . . . . 6 ⊢ (𝑦 = 𝑥 → ((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) = ((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < )))) |
| 13 | 12 | oveq1d 6094 | . . . . 5 ⊢ (𝑦 = 𝑥 → (((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) = (((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < ))) − (𝐹‘0))) |
| 14 | 13 | eleq1d 2307 | . . . 4 ⊢ (𝑦 = 𝑥 → ((((𝐹‘inf({𝑦, 0}, ℝ, < )) + (𝐺‘sup({𝑦, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ ↔ (((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ)) |
| 15 | 14 | cbvralv 2786 | . . 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 5852 | . 2 ⊢ (∀𝑥 ∈ ℝ (((𝐹‘inf({𝑥, 0}, ℝ, < )) + (𝐺‘sup({𝑥, 0}, ℝ, < ))) − (𝐹‘0)) ∈ ℝ ↔ 𝐻:ℝ⟶ℝ) |
| 18 | 16, 17 | sylib 122 | 1 ⊢ (𝜑 → 𝐻:ℝ⟶ℝ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 ∀wral 2528 {cpr 3709 ↦ cmpt 4190 ⟶wf 5371 ‘cfv 5375 (class class class)co 6079 supcsup 7316 infcinf 7317 ℝcr 8172 0cc0 8173 + caddc 8176 +∞cpnf 8351 -∞cmnf 8352 < clt 8354 − cmin 8491 (,]cioc 10274 [,)cico 10275 |
| 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 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 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-mulrcl 8272 ax-addcom 8273 ax-mulcom 8274 ax-addass 8275 ax-mulass 8276 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-1rid 8280 ax-0id 8281 ax-rnegex 8282 ax-precex 8283 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-apti 8288 ax-pre-ltadd 8289 ax-pre-mulgt0 8290 ax-pre-mulext 8291 ax-arch 8292 ax-caucvg 8293 |
| This theorem 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 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-po 4439 df-iso 4440 df-iord 4509 df-on 4511 df-ilim 4512 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-isom 5384 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-recs 6570 df-frec 6656 df-sup 7318 df-inf 7319 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-reap 8897 df-ap 8904 df-div 8997 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-n0 9547 df-z 9628 df-uz 9905 df-rp 10038 df-ioc 10278 df-ico 10279 df-seqfrec 10868 df-exp 10959 df-cj 11590 df-re 11591 df-im 11592 df-rsqrt 11747 df-abs 11748 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |