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

Theorem comfffval2 17609
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 2733 . . 3 (Hom ‘𝐶) = (Hom ‘𝐶)
4 comfffval2.x . . 3 · = (comp‘𝐶)
51, 2, 3, 4comfffval 17606 . 2 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)(Hom ‘𝐶)𝑦), 𝑓 ∈ ((Hom ‘𝐶)‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
6 comfffval2.h . . . . 5 𝐻 = (Homf𝐶)
7 xp2nd 7960 . . . . . 6 (𝑥 ∈ (𝐵 × 𝐵) → (2nd𝑥) ∈ 𝐵)
87adantr 480 . . . . 5 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (2nd𝑥) ∈ 𝐵)
9 simpr 484 . . . . 5 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → 𝑦𝐵)
106, 2, 3, 8, 9homfval 17600 . . . 4 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → ((2nd𝑥)𝐻𝑦) = ((2nd𝑥)(Hom ‘𝐶)𝑦))
11 xp1st 7959 . . . . . . . 8 (𝑥 ∈ (𝐵 × 𝐵) → (1st𝑥) ∈ 𝐵)
1211adantr 480 . . . . . . 7 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (1st𝑥) ∈ 𝐵)
136, 2, 3, 12, 8homfval 17600 . . . . . 6 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → ((1st𝑥)𝐻(2nd𝑥)) = ((1st𝑥)(Hom ‘𝐶)(2nd𝑥)))
14 df-ov 7355 . . . . . 6 ((1st𝑥)𝐻(2nd𝑥)) = (𝐻‘⟨(1st𝑥), (2nd𝑥)⟩)
15 df-ov 7355 . . . . . 6 ((1st𝑥)(Hom ‘𝐶)(2nd𝑥)) = ((Hom ‘𝐶)‘⟨(1st𝑥), (2nd𝑥)⟩)
1613, 14, 153eqtr3g 2791 . . . . 5 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (𝐻‘⟨(1st𝑥), (2nd𝑥)⟩) = ((Hom ‘𝐶)‘⟨(1st𝑥), (2nd𝑥)⟩))
17 1st2nd2 7966 . . . . . . 7 (𝑥 ∈ (𝐵 × 𝐵) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
1817adantr 480 . . . . . 6 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
1918fveq2d 6832 . . . . 5 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (𝐻𝑥) = (𝐻‘⟨(1st𝑥), (2nd𝑥)⟩))
2018fveq2d 6832 . . . . 5 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → ((Hom ‘𝐶)‘𝑥) = ((Hom ‘𝐶)‘⟨(1st𝑥), (2nd𝑥)⟩))
2116, 19, 203eqtr4d 2778 . . . 4 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (𝐻𝑥) = ((Hom ‘𝐶)‘𝑥))
22 eqidd 2734 . . . 4 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (𝑔(𝑥 · 𝑦)𝑓) = (𝑔(𝑥 · 𝑦)𝑓))
2310, 21, 22mpoeq123dv 7427 . . 3 ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦𝐵) → (𝑔 ∈ ((2nd𝑥)𝐻𝑦), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)) = (𝑔 ∈ ((2nd𝑥)(Hom ‘𝐶)𝑦), 𝑓 ∈ ((Hom ‘𝐶)‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
2423mpoeq3ia 7430 . 2 (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐻𝑦), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓))) = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)(Hom ‘𝐶)𝑦), 𝑓 ∈ ((Hom ‘𝐶)‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
255, 24eqtr4i 2759 1 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐻𝑦), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1541  wcel 2113  cop 4581   × cxp 5617  cfv 6486  (class class class)co 7352  cmpo 7354  1st c1st 7925  2nd c2nd 7926  Basecbs 17122  Hom chom 17174  compcco 17175  Homf chomf 17574  compfccomf 17575
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7355  df-oprab 7356  df-mpo 7357  df-1st 7927  df-2nd 7928  df-homf 17578  df-comf 17579
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator