Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > pcoval1 | Structured version Visualization version GIF version |
Description: Evaluate the concatenation of two paths on the first half. (Contributed by Jeff Madsen, 15-Jun-2010.) (Revised by Mario Carneiro, 7-Jun-2014.) |
Ref | Expression |
---|---|
pcoval.2 | ⊢ (𝜑 → 𝐹 ∈ (II Cn 𝐽)) |
pcoval.3 | ⊢ (𝜑 → 𝐺 ∈ (II Cn 𝐽)) |
Ref | Expression |
---|---|
pcoval1 | ⊢ ((𝜑 ∧ 𝑋 ∈ (0[,](1 / 2))) → ((𝐹(*𝑝‘𝐽)𝐺)‘𝑋) = (𝐹‘(2 · 𝑋))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0re 10645 | . . . . 5 ⊢ 0 ∈ ℝ | |
2 | 1re 10643 | . . . . 5 ⊢ 1 ∈ ℝ | |
3 | 0le0 11741 | . . . . 5 ⊢ 0 ≤ 0 | |
4 | halfre 11854 | . . . . . 6 ⊢ (1 / 2) ∈ ℝ | |
5 | halflt1 11858 | . . . . . 6 ⊢ (1 / 2) < 1 | |
6 | 4, 2, 5 | ltleii 10765 | . . . . 5 ⊢ (1 / 2) ≤ 1 |
7 | iccss 12807 | . . . . 5 ⊢ (((0 ∈ ℝ ∧ 1 ∈ ℝ) ∧ (0 ≤ 0 ∧ (1 / 2) ≤ 1)) → (0[,](1 / 2)) ⊆ (0[,]1)) | |
8 | 1, 2, 3, 6, 7 | mp4an 691 | . . . 4 ⊢ (0[,](1 / 2)) ⊆ (0[,]1) |
9 | 8 | sseli 3965 | . . 3 ⊢ (𝑋 ∈ (0[,](1 / 2)) → 𝑋 ∈ (0[,]1)) |
10 | pcoval.2 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (II Cn 𝐽)) | |
11 | pcoval.3 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ (II Cn 𝐽)) | |
12 | 10, 11 | pcovalg 23618 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (0[,]1)) → ((𝐹(*𝑝‘𝐽)𝐺)‘𝑋) = if(𝑋 ≤ (1 / 2), (𝐹‘(2 · 𝑋)), (𝐺‘((2 · 𝑋) − 1)))) |
13 | 9, 12 | sylan2 594 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ (0[,](1 / 2))) → ((𝐹(*𝑝‘𝐽)𝐺)‘𝑋) = if(𝑋 ≤ (1 / 2), (𝐹‘(2 · 𝑋)), (𝐺‘((2 · 𝑋) − 1)))) |
14 | elii1 23541 | . . . . 5 ⊢ (𝑋 ∈ (0[,](1 / 2)) ↔ (𝑋 ∈ (0[,]1) ∧ 𝑋 ≤ (1 / 2))) | |
15 | 14 | simprbi 499 | . . . 4 ⊢ (𝑋 ∈ (0[,](1 / 2)) → 𝑋 ≤ (1 / 2)) |
16 | 15 | iftrued 4477 | . . 3 ⊢ (𝑋 ∈ (0[,](1 / 2)) → if(𝑋 ≤ (1 / 2), (𝐹‘(2 · 𝑋)), (𝐺‘((2 · 𝑋) − 1))) = (𝐹‘(2 · 𝑋))) |
17 | 16 | adantl 484 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ (0[,](1 / 2))) → if(𝑋 ≤ (1 / 2), (𝐹‘(2 · 𝑋)), (𝐺‘((2 · 𝑋) − 1))) = (𝐹‘(2 · 𝑋))) |
18 | 13, 17 | eqtrd 2858 | 1 ⊢ ((𝜑 ∧ 𝑋 ∈ (0[,](1 / 2))) → ((𝐹(*𝑝‘𝐽)𝐺)‘𝑋) = (𝐹‘(2 · 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ⊆ wss 3938 ifcif 4469 class class class wbr 5068 ‘cfv 6357 (class class class)co 7158 ℝcr 10538 0cc0 10539 1c1 10540 · cmul 10544 ≤ cle 10678 − cmin 10872 / cdiv 11299 2c2 11695 [,]cicc 12744 Cn ccn 21834 IIcii 23485 *𝑝cpco 23606 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-po 5476 df-so 5477 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-1st 7691 df-2nd 7692 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-2 11703 df-icc 12748 df-top 21504 df-topon 21521 df-cn 21837 df-pco 23611 |
This theorem is referenced by: pco0 23620 pcoass 23630 pcorevlem 23632 |
Copyright terms: Public domain | W3C validator |