Theorem comffval 17793

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.

Step	Hyp	Ref	Expression
1		comfffval.o	. . . 4 ⊢ 𝑂 = (compf‘𝐶)
2		comfffval.b	. . . 4 ⊢ 𝐵 = (Base‘𝐶)
3		comfffval.h	. . . 4 ⊢ 𝐻 = (Hom ‘𝐶)
4		comfffval.x	. . . 4 ⊢ · = (comp‘𝐶)
5	1, 2, 3, 4	comfffval 17792	. . 3 ⊢ 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑥)𝐻𝑧), 𝑓 ∈ (𝐻‘𝑥) ↦ (𝑔(𝑥 · 𝑧)𝑓)))
6	5	a1i 11	. 2 ⊢ (𝜑 → 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑥)𝐻𝑧), 𝑓 ∈ (𝐻‘𝑥) ↦ (𝑔(𝑥 · 𝑧)𝑓))))
7		simprl 783	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → 𝑥 = ⟨𝑋, 𝑌⟩)
8	7	fveq2d 6886	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (2nd ‘𝑥) = (2nd ‘⟨𝑋, 𝑌⟩))
9		comffval.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
10		comffval.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
11		op2ndg 8003	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
12	9, 10, 11	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
13	12	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
14	8, 13	eqtrd 2797	. . . 4 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (2nd ‘𝑥) = 𝑌)
15		simprr 785	. . . 4 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → 𝑧 = 𝑍)
16	14, 15	oveq12d 7435	. . 3 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → ((2nd ‘𝑥)𝐻𝑧) = (𝑌𝐻𝑍))
17	7	fveq2d 6886	. . . 4 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝐻‘𝑥) = (𝐻‘⟨𝑋, 𝑌⟩))
18		df-ov 7420	. . . 4 ⊢ (𝑋𝐻𝑌) = (𝐻‘⟨𝑋, 𝑌⟩)
19	17, 18	eqtr4di 2815	. . 3 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝐻‘𝑥) = (𝑋𝐻𝑌))
20	7, 15	oveq12d 7435	. . . 4 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝑥 · 𝑧) = (⟨𝑋, 𝑌⟩ · 𝑍))
21	20	oveqd 7434	. . 3 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝑔(𝑥 · 𝑧)𝑓) = (𝑔(⟨𝑋, 𝑌⟩ · 𝑍)𝑓))
22	16, 19, 21	mpoeq123dv 7492	. 2 ⊢ ((𝜑 ∧ (𝑥 = ⟨𝑋, 𝑌⟩ ∧ 𝑧 = 𝑍)) → (𝑔 ∈ ((2nd ‘𝑥)𝐻𝑧), 𝑓 ∈ (𝐻‘𝑥) ↦ (𝑔(𝑥 · 𝑧)𝑓)) = (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌⟩ · 𝑍)𝑓)))
23	9, 10	opelxpd 5698	. 2 ⊢ (𝜑 → ⟨𝑋, 𝑌⟩ ∈ (𝐵 × 𝐵))
24		comffval.z	. 2 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
25		ovex 7450	. . . 4 ⊢ (𝑌𝐻𝑍) ∈ V
26		ovex 7450	. . . 4 ⊢ (𝑋𝐻𝑌) ∈ V
27	25, 26	mpoex 8082	. . 3 ⊢ (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌⟩ · 𝑍)𝑓)) ∈ V
28	27	a1i 11	. 2 ⊢ (𝜑 → (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌⟩ · 𝑍)𝑓)) ∈ V)
29	6, 22, 23, 24, 28	ovmpod 7569	1 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩𝑂𝑍) = (𝑔 ∈ (𝑌𝐻𝑍), 𝑓 ∈ (𝑋𝐻𝑌) ↦ (𝑔(⟨𝑋, 𝑌⟩ · 𝑍)𝑓)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3453  ⟨cop 4593   × cxp 5657  ‘cfv 6537  (class class class)co 7417   ∈ cmpo 7419  2^nd c2nd 7989  Basecbs 17307  Hom chom 17359  compcco 17360  comp_fccomf 17761

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-comf 17765

This theorem is used by:  comfval  17794  comffval2  17796  comffn  17799