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

Theorem comffval 17593
Description: Value of the functionalized composition operation. (Contributed by Mario Carneiro, 4-Jan-2017.)
Hypotheses
Ref Expression
comfffval.o 𝑂 = (compf𝐶)
comfffval.b 𝐵 = (Base‘𝐶)
comfffval.h 𝐻 = (Hom ‘𝐶)
comfffval.x · = (comp‘𝐶)
comffval.x (𝜑𝑋𝐵)
comffval.y (𝜑𝑌𝐵)
comffval.z (𝜑𝑍𝐵)
Assertion
Ref Expression
comffval (𝜑 → (⟨𝑋, 𝑌𝑂𝑍) = (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓)))
Distinct variable groups:   𝑓,𝑔,𝐶   𝜑,𝑓,𝑔   · ,𝑓,𝑔   𝑓,𝑋,𝑔   𝑓,𝑌,𝑔   𝑓,𝑍,𝑔   𝑓,𝐻,𝑔
Allowed substitution hints:   𝐵(𝑓,𝑔)   𝑂(𝑓,𝑔)

Proof of Theorem comffval
Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 comfffval.o . . . 4 𝑂 = (compf𝐶)
2 comfffval.b . . . 4 𝐵 = (Base‘𝐶)
3 comfffval.h . . . 4 𝐻 = (Hom ‘𝐶)
4 comfffval.x . . . 4 · = (comp‘𝐶)
51, 2, 3, 4comfffval 17592 . . 3 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐻𝑧), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑧)𝑓)))
65a1i 11 . 2 (𝜑𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐻𝑧), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑧)𝑓))))
7 simprl 769 . . . . . 6 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → 𝑥 = ⟨𝑋, 𝑌⟩)
87fveq2d 6851 . . . . 5 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (2nd𝑥) = (2nd ‘⟨𝑋, 𝑌⟩))
9 comffval.x . . . . . . 7 (𝜑𝑋𝐵)
10 comffval.y . . . . . . 7 (𝜑𝑌𝐵)
11 op2ndg 7939 . . . . . . 7 ((𝑋𝐵𝑌𝐵) → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
129, 10, 11syl2anc 584 . . . . . 6 (𝜑 → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
1312adantr 481 . . . . 5 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
148, 13eqtrd 2771 . . . 4 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (2nd𝑥) = 𝑌)
15 simprr 771 . . . 4 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → 𝑧 = 𝑍)
1614, 15oveq12d 7380 . . 3 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → ((2nd𝑥)𝐻𝑧) = (𝑌𝐻𝑍))
177fveq2d 6851 . . . 4 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝐻𝑥) = (𝐻‘⟨𝑋, 𝑌⟩))
18 df-ov 7365 . . . 4 (𝑋𝐻𝑌) = (𝐻‘⟨𝑋, 𝑌⟩)
1917, 18eqtr4di 2789 . . 3 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝐻𝑥) = (𝑋𝐻𝑌))
207, 15oveq12d 7380 . . . 4 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝑥 · 𝑧) = (⟨𝑋, 𝑌· 𝑍))
2120oveqd 7379 . . 3 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝑔(𝑥 · 𝑧)𝑓) = (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓))
2216, 19, 21mpoeq123dv 7437 . 2 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝑔 ∈ ((2nd𝑥)𝐻𝑧), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑧)𝑓)) = (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓)))
239, 10opelxpd 5676 . 2 (𝜑 → ⟨𝑋, 𝑌⟩ ∈ (𝐵 × 𝐵))
24 comffval.z . 2 (𝜑𝑍𝐵)
25 ovex 7395 . . . 4 (𝑌𝐻𝑍) ∈ V
26 ovex 7395 . . . 4 (𝑋𝐻𝑌) ∈ V
2725, 26mpoex 8017 . . 3 (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓)) ∈ V
2827a1i 11 . 2 (𝜑 → (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓)) ∈ V)
296, 22, 23, 24, 28ovmpod 7512 1 (𝜑 → (⟨𝑋, 𝑌𝑂𝑍) = (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wcel 2106  Vcvv 3446  cop 4597   × cxp 5636  cfv 6501  (class class class)co 7362  cmpo 7364  2nd c2nd 7925  Basecbs 17094  Hom chom 17158  compcco 17159  compfccomf 17561
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5247  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-id 5536  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-ov 7365  df-oprab 7366  df-mpo 7367  df-1st 7926  df-2nd 7927  df-comf 17565
This theorem is referenced by:  comfval  17594  comffval2  17596  comffn  17599
  Copyright terms: Public domain W3C validator