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

Theorem comfffval2 17758
Description: Value of the functionalized composition operation. (Contributed by Mario Carneiro, 4-Jan-2017.)
Hypotheses
Ref Expression
comfffval2.o 𝑂 = (compf𝐶)
comfffval2.b 𝐵 = (Base‘𝐶)
comfffval2.h 𝐻 = (Homf𝐶)
comfffval2.x · = (comp‘𝐶)
Assertion
Ref Expression
comfffval2 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐻𝑦), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
Distinct variable groups:   𝑓,𝑔,𝑥,𝑦,𝐵   𝐶,𝑓,𝑔,𝑥,𝑦   · ,𝑓,𝑔,𝑥
Allowed substitution hints:   · (𝑦)   𝐻(𝑥,𝑦,𝑓,𝑔)   𝑂(𝑥,𝑦,𝑓,𝑔)

Proof of Theorem comfffval2
StepHypRef Expression
1 comfffval2.o . . 3 𝑂 = (compf𝐶)
2 comfffval2.b . . 3 𝐵 = (Base‘𝐶)
3 eqid 2763 . . 3 (Hom ‘𝐶) = (Hom ‘𝐶)
4 comfffval2.x . . 3 · = (comp‘𝐶)
51, 2, 3, 4comfffval 17755 . 2 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)(Hom ‘𝐶)𝑦), 𝑓 ∈ ((Hom ‘𝐶)‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
6 comfffval2.h . . . . 5 𝐻 = (Homf𝐶)
7 xp2nd 8020 . . . . . 6 (𝑥 ∈ (𝐵 × 𝐵) → (2nd𝑥) ∈ 𝐵)
87adantr 485 . . . . 5 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (2nd𝑥) ∈ 𝐵)
9 simpr 489 . . . . 5 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → 𝑦𝐵)
106, 2, 3, 8, 9homfval 17749 . . . 4 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → ((2nd𝑥)𝐻𝑦) = ((2nd𝑥)(Hom ‘𝐶)𝑦))
11 xp1st 8019 . . . . . . . 8 (𝑥 ∈ (𝐵 × 𝐵) → (1st𝑥) ∈ 𝐵)
1211adantr 485 . . . . . . 7 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (1st𝑥) ∈ 𝐵)
136, 2, 3, 12, 8homfval 17749 . . . . . 6 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → ((1st𝑥)𝐻(2nd𝑥)) = ((1st𝑥)(Hom ‘𝐶)(2nd𝑥)))
14 df-ov 7415 . . . . . 6 ((1st𝑥)𝐻(2nd𝑥)) = (𝐻‘⟨(1st𝑥), (2nd𝑥)⟩)
15 df-ov 7415 . . . . . 6 ((1st𝑥)(Hom ‘𝐶)(2nd𝑥)) = ((Hom ‘𝐶)‘⟨(1st𝑥), (2nd𝑥)⟩)
1613, 14, 153eqtr3g 2821 . . . . 5 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (𝐻‘⟨(1st𝑥), (2nd𝑥)⟩) = ((Hom ‘𝐶)‘⟨(1st𝑥), (2nd𝑥)⟩))
17 1st2nd2 8026 . . . . . . 7 (𝑥 ∈ (𝐵 × 𝐵) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
1817adantr 485 . . . . . 6 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
1918fveq2d 6887 . . . . 5 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (𝐻𝑥) = (𝐻‘⟨(1st𝑥), (2nd𝑥)⟩))
2018fveq2d 6887 . . . . 5 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → ((Hom ‘𝐶)‘𝑥) = ((Hom ‘𝐶)‘⟨(1st𝑥), (2nd𝑥)⟩))
2116, 19, 203eqtr4d 2808 . . . 4 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (𝐻𝑥) = ((Hom ‘𝐶)‘𝑥))
22 eqidd 2764 . . . 4 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (𝑔(𝑥 · 𝑦)𝑓) = (𝑔(𝑥 · 𝑦)𝑓))
2310, 21, 22mpoeq123dv 7487 . . 3 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (𝑔 ∈ ((2nd𝑥)𝐻𝑦), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)) = (𝑔 ∈ ((2nd𝑥)(Hom ‘𝐶)𝑦), 𝑓 ∈ ((Hom ‘𝐶)‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
2423mpoeq3ia 7490 . 2 (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐻𝑦), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓))) = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)(Hom ‘𝐶)𝑦), 𝑓 ∈ ((Hom ‘𝐶)‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
255, 24eqtr4i 2789 1 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐻𝑦), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
Colors of variables: wff setvar class
Syntax hints:  wa 400   = wceq 1570  wcel 2143  cop 4596   × cxp 5661  cfv 6538  (class class class)co 7412  cmpo 7414  1st c1st 7985  2nd c2nd 7986  Basecbs 17270  Hom chom 17322  compcco 17323  Homf chomf 17723  compfccomf 17724
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7987  df-2nd 7988  df-homf 17727  df-comf 17728
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator