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

Theorem comffval 17780
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 17779 . . 3 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐻𝑧), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑧)𝑓)))
65a1i 11 . 2 (𝜑𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐻𝑧), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑧)𝑓))))
7 simprl 783 . . . . . 6 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → 𝑥 = ⟨𝑋, 𝑌⟩)
87fveq2d 6892 . . . . 5 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (2nd𝑥) = (2nd ‘⟨𝑋, 𝑌⟩))
9 comffval.x . . . . . . 7 (𝜑𝑋𝐵)
10 comffval.y . . . . . . 7 (𝜑𝑌𝐵)
11 op2ndg 8008 . . . . . . 7 ((𝑋𝐵𝑌𝐵) → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
129, 10, 11syl2anc 596 . . . . . 6 (𝜑 → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
1312adantr 486 . . . . 5 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
148, 13eqtrd 2801 . . . 4 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (2nd𝑥) = 𝑌)
15 simprr 785 . . . 4 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → 𝑧 = 𝑍)
1614, 15oveq12d 7441 . . 3 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → ((2nd𝑥)𝐻𝑧) = (𝑌𝐻𝑍))
177fveq2d 6892 . . . 4 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝐻𝑥) = (𝐻‘⟨𝑋, 𝑌⟩))
18 df-ov 7426 . . . 4 (𝑋𝐻𝑌) = (𝐻‘⟨𝑋, 𝑌⟩)
1917, 18eqtr4di 2819 . . 3 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝐻𝑥) = (𝑋𝐻𝑌))
207, 15oveq12d 7441 . . . 4 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝑥 · 𝑧) = (⟨𝑋, 𝑌· 𝑍))
2120oveqd 7440 . . 3 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝑔(𝑥 · 𝑧)𝑓) = (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓))
2216, 19, 21mpoeq123dv 7498 . 2 ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝑔 ∈ ((2nd𝑥)𝐻𝑧), 𝑓 ∈ (𝐻𝑥) ↦ (𝑔(𝑥 · 𝑧)𝑓)) = (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓)))
239, 10opelxpd 5705 . 2 (𝜑 → ⟨𝑋, 𝑌⟩ ∈ (𝐵 × 𝐵))
24 comffval.z . 2 (𝜑𝑍𝐵)
25 ovex 7456 . . . 4 (𝑌𝐻𝑍) ∈ V
26 ovex 7456 . . . 4 (𝑋𝐻𝑌) ∈ V
2725, 26mpoex 8085 . . 3 (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓)) ∈ V
2827a1i 11 . 2 (𝜑 → (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓)) ∈ V)
296, 22, 23, 24, 28ovmpod 7575 1 (𝜑 → (⟨𝑋, 𝑌𝑂𝑍) = (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌· 𝑍)𝑓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  Vcvv 3458  cop 4600   × cxp 5664  cfv 6543  (class class class)co 7423  cmpo 7425  2nd c2nd 7994  Basecbs 17294  Hom chom 17346  compcco 17347  compfccomf 17748
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-comf 17752
This theorem is used by:  comfval  17781  comffval2  17783  comffn  17786
  Copyright terms: Public domain W3C validator