Theorem comfeqval 17672

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 7380	. . 3 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩(compf‘𝐶)𝑍) = (⟨𝑋, 𝑌⟩(compf‘𝐷)𝑍))
3	2	oveqd 7380	. 2 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(compf‘𝐶)𝑍)𝐹) = (𝐺(⟨𝑋, 𝑌⟩(compf‘𝐷)𝑍)𝐹))
4		eqid 2740	. . 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 17664	. 2 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(compf‘𝐶)𝑍)𝐹) = (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
14		eqid 2740	. . 3 ⊢ (compf‘𝐷) = (compf‘𝐷)
15		eqid 2740	. . 3 ⊢ (Base‘𝐷) = (Base‘𝐷)
16		eqid 2740	. . 3 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
17		comfeqval.2	. . 3 ⊢ ∙ = (comp‘𝐷)
18		comfeqval.3	. . . . . 6 ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
19	18	homfeqbas 17660	. . . . 5 ⊢ (𝜑 → (Base‘𝐶) = (Base‘𝐷))
20	5, 19	eqtrid 2787	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘𝐷))
21	8, 20	eleqtrd 2842	. . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐷))
22	9, 20	eleqtrd 2842	. . 3 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐷))
23	10, 20	eleqtrd 2842	. . 3 ⊢ (𝜑 → 𝑍 ∈ (Base‘𝐷))
24	5, 6, 16, 18, 8, 9	homfeqval 17661	. . . 4 ⊢ (𝜑 → (𝑋𝐻𝑌) = (𝑋(Hom ‘𝐷)𝑌))
25	11, 24	eleqtrd 2842	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝑋(Hom ‘𝐷)𝑌))
26	5, 6, 16, 18, 9, 10	homfeqval 17661	. . . 4 ⊢ (𝜑 → (𝑌𝐻𝑍) = (𝑌(Hom ‘𝐷)𝑍))
27	12, 26	eleqtrd 2842	. . 3 ⊢ (𝜑 → 𝐺 ∈ (𝑌(Hom ‘𝐷)𝑍))
28	14, 15, 16, 17, 21, 22, 23, 25, 27	comfval 17664	. 2 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(compf‘𝐷)𝑍)𝐹) = (𝐺(⟨𝑋, 𝑌⟩ ∙ 𝑍)𝐹))
29	3, 13, 28	3eqtr3d 2783	1 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = (𝐺(⟨𝑋, 𝑌⟩ ∙ 𝑍)𝐹))

Syntax hints:   → wi 4   = wceq 1547   ∈ wcel 2119  ⟨cop 4568  ‘cfv 6492  (class class class)co 7363  Basecbs 17177  Hom chom 17229  compcco 17230  Hom_f chomf 17630  comp_fccomf 17631

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7366  df-oprab 7367  df-mpo 7368  df-1st 7938  df-2nd 7939  df-homf 17634  df-comf 17635

This theorem is referenced by:  catpropd  17673  cidpropd  17674  oppccomfpropd  17691  monpropd  17702  funcpropd  17867  natpropd  17944  fucpropd  17945  xpcpropd  18172  hofpropd  18231  sectpropdlem  49533  uppropd  49678