MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pcoval Structured version   Visualization version   GIF version

Theorem pcoval 23622
Description: The concatenation of two paths. (Contributed by Jeff Madsen, 15-Jun-2010.) (Revised by Mario Carneiro, 23-Aug-2014.)
Hypotheses
Ref Expression
pcoval.2 (𝜑𝐹 ∈ (II Cn 𝐽))
pcoval.3 (𝜑𝐺 ∈ (II Cn 𝐽))
Assertion
Ref Expression
pcoval (𝜑 → (𝐹(*𝑝𝐽)𝐺) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐺‘((2 · 𝑥) − 1)))))
Distinct variable groups:   𝑥,𝐹   𝑥,𝐺   𝜑,𝑥   𝑥,𝐽

Proof of Theorem pcoval
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pcoval.2 . 2 (𝜑𝐹 ∈ (II Cn 𝐽))
2 pcoval.3 . 2 (𝜑𝐺 ∈ (II Cn 𝐽))
3 fveq1 6660 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘(2 · 𝑥)) = (𝐹‘(2 · 𝑥)))
43adantr 484 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓‘(2 · 𝑥)) = (𝐹‘(2 · 𝑥)))
5 fveq1 6660 . . . . . 6 (𝑔 = 𝐺 → (𝑔‘((2 · 𝑥) − 1)) = (𝐺‘((2 · 𝑥) − 1)))
65adantl 485 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑔‘((2 · 𝑥) − 1)) = (𝐺‘((2 · 𝑥) − 1)))
74, 6ifeq12d 4470 . . . 4 ((𝑓 = 𝐹𝑔 = 𝐺) → if(𝑥 ≤ (1 / 2), (𝑓‘(2 · 𝑥)), (𝑔‘((2 · 𝑥) − 1))) = if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐺‘((2 · 𝑥) − 1))))
87mpteq2dv 5148 . . 3 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝑓‘(2 · 𝑥)), (𝑔‘((2 · 𝑥) − 1)))) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐺‘((2 · 𝑥) − 1)))))
9 pcofval 23621 . . 3 (*𝑝𝐽) = (𝑓 ∈ (II Cn 𝐽), 𝑔 ∈ (II Cn 𝐽) ↦ (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝑓‘(2 · 𝑥)), (𝑔‘((2 · 𝑥) − 1)))))
10 ovex 7182 . . . 4 (0[,]1) ∈ V
1110mptex 6977 . . 3 (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐺‘((2 · 𝑥) − 1)))) ∈ V
128, 9, 11ovmpoa 7298 . 2 ((𝐹 ∈ (II Cn 𝐽) ∧ 𝐺 ∈ (II Cn 𝐽)) → (𝐹(*𝑝𝐽)𝐺) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐺‘((2 · 𝑥) − 1)))))
131, 2, 12syl2anc 587 1 (𝜑 → (𝐹(*𝑝𝐽)𝐺) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐺‘((2 · 𝑥) − 1)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2115  ifcif 4450   class class class wbr 5052  cmpt 5132  cfv 6343  (class class class)co 7149  0cc0 10535  1c1 10536   · cmul 10540  cle 10674  cmin 10868   / cdiv 11295  2c2 11689  [,]cicc 12738   Cn ccn 21835  IIcii 23486  *𝑝cpco 23611
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-rep 5176  ax-sep 5189  ax-nul 5196  ax-pow 5253  ax-pr 5317  ax-un 7455
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3015  df-ral 3138  df-rex 3139  df-reu 3140  df-rab 3142  df-v 3482  df-sbc 3759  df-csb 3867  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-nul 4277  df-if 4451  df-pw 4524  df-sn 4551  df-pr 4553  df-op 4557  df-uni 4825  df-iun 4907  df-br 5053  df-opab 5115  df-mpt 5133  df-id 5447  df-xp 5548  df-rel 5549  df-cnv 5550  df-co 5551  df-dm 5552  df-rn 5553  df-res 5554  df-ima 5555  df-iota 6302  df-fun 6345  df-fn 6346  df-f 6347  df-f1 6348  df-fo 6349  df-f1o 6350  df-fv 6351  df-ov 7152  df-oprab 7153  df-mpo 7154  df-1st 7684  df-2nd 7685  df-map 8404  df-top 21505  df-topon 21522  df-cn 21838  df-pco 23616
This theorem is referenced by:  pcovalg  23623  pco1  23626  pcocn  23628  copco  23629  pcopt  23633  pcopt2  23634  pcoass  23635
  Copyright terms: Public domain W3C validator