Theorem comfeqval 17754

Description: Equality of two compositions. (Contributed by Mario Carneiro, 4-Jan-2017.)

Hypotheses

Ref	Expression
comfeqval.b	⊢ 𝐵 = (Base‘𝐶)
comfeqval.h	⊢ 𝐻 = (Hom ‘𝐶)
comfeqval.1	⊢ · = (comp‘𝐶)
comfeqval.2	⊢ ∙ = (comp‘𝐷)
comfeqval.3	⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
comfeqval.4	⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷))
comfeqval.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
comfeqval.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
comfeqval.z	⊢ (𝜑 → 𝑍 ∈ 𝐵)
comfeqval.f	⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
comfeqval.g	⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑍))

Assertion

Ref	Expression
comfeqval	⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = (𝐺(⟨𝑋, 𝑌⟩ ∙ 𝑍)𝐹))

Proof of Theorem comfeqval

Step	Hyp	Ref	Expression
1		comfeqval.4	. . . 4 ⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷))
2	1	oveqd 7417	. . 3 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩(compf‘𝐶)𝑍) = (⟨𝑋, 𝑌⟩(compf‘𝐷)𝑍))
3	2	oveqd 7417	. 2 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(compf‘𝐶)𝑍)𝐹) = (𝐺(⟨𝑋, 𝑌⟩(compf‘𝐷)𝑍)𝐹))
4		eqid 2765	. . 3 ⊢ (compf‘𝐶) = (compf‘𝐶)
5		comfeqval.b	. . 3 ⊢ 𝐵 = (Base‘𝐶)
6		comfeqval.h	. . 3 ⊢ 𝐻 = (Hom ‘𝐶)
7		comfeqval.1	. . 3 ⊢ · = (comp‘𝐶)
8		comfeqval.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
9		comfeqval.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
10		comfeqval.z	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
11		comfeqval.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
12		comfeqval.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑍))
13	4, 5, 6, 7, 8, 9, 10, 11, 12	comfval 17746	. 2 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(compf‘𝐶)𝑍)𝐹) = (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
14		eqid 2765	. . 3 ⊢ (compf‘𝐷) = (compf‘𝐷)
15		eqid 2765	. . 3 ⊢ (Base‘𝐷) = (Base‘𝐷)
16		eqid 2765	. . 3 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
17		comfeqval.2	. . 3 ⊢ ∙ = (comp‘𝐷)
18		comfeqval.3	. . . . . 6 ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
19	18	homfeqbas 17742	. . . . 5 ⊢ (𝜑 → (Base‘𝐶) = (Base‘𝐷))
20	5, 19	eqtrid 2812	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘𝐷))
21	8, 20	eleqtrd 2867	. . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐷))
22	9, 20	eleqtrd 2867	. . 3 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐷))
23	10, 20	eleqtrd 2867	. . 3 ⊢ (𝜑 → 𝑍 ∈ (Base‘𝐷))
24	5, 6, 16, 18, 8, 9	homfeqval 17743	. . . 4 ⊢ (𝜑 → (𝑋𝐻𝑌) = (𝑋(Hom ‘𝐷)𝑌))
25	11, 24	eleqtrd 2867	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝑋(Hom ‘𝐷)𝑌))
26	5, 6, 16, 18, 9, 10	homfeqval 17743	. . . 4 ⊢ (𝜑 → (𝑌𝐻𝑍) = (𝑌(Hom ‘𝐷)𝑍))
27	12, 26	eleqtrd 2867	. . 3 ⊢ (𝜑 → 𝐺 ∈ (𝑌(Hom ‘𝐷)𝑍))
28	14, 15, 16, 17, 21, 22, 23, 25, 27	comfval 17746	. 2 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(compf‘𝐷)𝑍)𝐹) = (𝐺(⟨𝑋, 𝑌⟩ ∙ 𝑍)𝐹))
29	3, 13, 28	3eqtr3d 2808	1 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = (𝐺(⟨𝑋, 𝑌⟩ ∙ 𝑍)𝐹))

Syntax hints:   → wi 4   = wceq 1563   ∈ wcel 2145  ⟨cop 4591  ‘cfv 6525  (class class class)co 7400  Basecbs 17259  Hom chom 17311  compcco 17312  Hom_f chomf 17712  comp_fccomf 17713

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7974  df-2nd 7975  df-homf 17716  df-comf 17717

This theorem is referenced by:  catpropd  17755  cidpropd  17756  oppccomfpropd  17773  monpropd  17784  funcpropd  17949  natpropd  18026  fucpropd  18027  xpcpropd  18254  hofpropd  18313  sectpropdlem  49665  uppropd  49810