Theorem coaval 18004

Description: Value of composition for composable arrows. (Contributed by Mario Carneiro, 11-Jan-2017.)

Hypotheses

Ref	Expression
homdmcoa.o	⊢ · = (compa‘𝐶)
homdmcoa.h	⊢ 𝐻 = (Homa‘𝐶)
homdmcoa.f	⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
homdmcoa.g	⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑍))
coaval.x	⊢ ∙ = (comp‘𝐶)

Assertion

Ref	Expression
coaval	⊢ (𝜑 → (𝐺 · 𝐹) = ⟨𝑋, 𝑍, ((2nd ‘𝐺)(⟨𝑋, 𝑌⟩ ∙ 𝑍)(2nd ‘𝐹))⟩)

Proof of Theorem coaval

Dummy variables 𝑓 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		homdmcoa.o	. . 3 ⊢ · = (compa‘𝐶)
2		eqid 2737	. . 3 ⊢ (Arrow‘𝐶) = (Arrow‘𝐶)
3		coaval.x	. . 3 ⊢ ∙ = (comp‘𝐶)
4	1, 2, 3	coafval 18000	. 2 ⊢ · = (𝑔 ∈ (Arrow‘𝐶), 𝑓 ∈ {ℎ ∈ (Arrow‘𝐶) ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩)
5		homdmcoa.h	. . . . 5 ⊢ 𝐻 = (Homa‘𝐶)
6	2, 5	homarw 17982	. . . 4 ⊢ (𝑌𝐻𝑍) ⊆ (Arrow‘𝐶)
7		homdmcoa.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑍))
8	6, 7	sselid 3933	. . 3 ⊢ (𝜑 → 𝐺 ∈ (Arrow‘𝐶))
9		fveqeq2 6851	. . . 4 ⊢ (ℎ = 𝐹 → ((coda‘ℎ) = (doma‘𝑔) ↔ (coda‘𝐹) = (doma‘𝑔)))
10	2, 5	homarw 17982	. . . . 5 ⊢ (𝑋𝐻𝑌) ⊆ (Arrow‘𝐶)
11		homdmcoa.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
12	11	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → 𝐹 ∈ (𝑋𝐻𝑌))
13	10, 12	sselid 3933	. . . 4 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → 𝐹 ∈ (Arrow‘𝐶))
14	5	homacd 17977	. . . . . 6 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (coda‘𝐹) = 𝑌)
15	12, 14	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (coda‘𝐹) = 𝑌)
16		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
17	16	fveq2d 6846	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (doma‘𝑔) = (doma‘𝐺))
18	7	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → 𝐺 ∈ (𝑌𝐻𝑍))
19	5	homadm 17976	. . . . . . 7 ⊢ (𝐺 ∈ (𝑌𝐻𝑍) → (doma‘𝐺) = 𝑌)
20	18, 19	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (doma‘𝐺) = 𝑌)
21	17, 20	eqtrd 2772	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (doma‘𝑔) = 𝑌)
22	15, 21	eqtr4d 2775	. . . 4 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (coda‘𝐹) = (doma‘𝑔))
23	9, 13, 22	elrabd 3650	. . 3 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → 𝐹 ∈ {ℎ ∈ (Arrow‘𝐶) ∣ (coda‘ℎ) = (doma‘𝑔)})
24		otex 5421	. . . 4 ⊢ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩ ∈ V
25	24	a1i 11	. . 3 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩ ∈ V)
26		simprr 773	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝑓 = 𝐹)
27	26	fveq2d 6846	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (doma‘𝑓) = (doma‘𝐹))
28	5	homadm 17976	. . . . . . 7 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (doma‘𝐹) = 𝑋)
29	12, 28	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (doma‘𝐹) = 𝑋)
30	29	adantrr 718	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (doma‘𝐹) = 𝑋)
31	27, 30	eqtrd 2772	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (doma‘𝑓) = 𝑋)
32	16	fveq2d 6846	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (coda‘𝑔) = (coda‘𝐺))
33	5	homacd 17977	. . . . . . 7 ⊢ (𝐺 ∈ (𝑌𝐻𝑍) → (coda‘𝐺) = 𝑍)
34	18, 33	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (coda‘𝐺) = 𝑍)
35	32, 34	eqtrd 2772	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (coda‘𝑔) = 𝑍)
36	35	adantrr 718	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (coda‘𝑔) = 𝑍)
37	21	adantrr 718	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (doma‘𝑔) = 𝑌)
38	31, 37	opeq12d 4839	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ⟨(doma‘𝑓), (doma‘𝑔)⟩ = ⟨𝑋, 𝑌⟩)
39	38, 36	oveq12d 7386	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔)) = (⟨𝑋, 𝑌⟩ ∙ 𝑍))
40		simprl 771	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝑔 = 𝐺)
41	40	fveq2d 6846	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2nd ‘𝑔) = (2nd ‘𝐺))
42	26	fveq2d 6846	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2nd ‘𝑓) = (2nd ‘𝐹))
43	39, 41, 42	oveq123d 7389	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓)) = ((2nd ‘𝐺)(⟨𝑋, 𝑌⟩ ∙ 𝑍)(2nd ‘𝐹)))
44	31, 36, 43	oteq123d 4846	. . 3 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩ = ⟨𝑋, 𝑍, ((2nd ‘𝐺)(⟨𝑋, 𝑌⟩ ∙ 𝑍)(2nd ‘𝐹))⟩)
45	8, 23, 25, 44	ovmpodv2 7526	. 2 ⊢ (𝜑 → ( · = (𝑔 ∈ (Arrow‘𝐶), 𝑓 ∈ {ℎ ∈ (Arrow‘𝐶) ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩) → (𝐺 · 𝐹) = ⟨𝑋, 𝑍, ((2nd ‘𝐺)(⟨𝑋, 𝑌⟩ ∙ 𝑍)(2nd ‘𝐹))⟩))
46	4, 45	mpi 20	1 ⊢ (𝜑 → (𝐺 · 𝐹) = ⟨𝑋, 𝑍, ((2nd ‘𝐺)(⟨𝑋, 𝑌⟩ ∙ 𝑍)(2nd ‘𝐹))⟩)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {crab 3401  Vcvv 3442  ⟨cop 4588  ⟨cotp 4590  ‘cfv 6500  (class class class)co 7368   ∈ cmpo 7370  2^nd c2nd 7942  compcco 17201  dom_acdoma 17956  cod_accoda 17957  Arrowcarw 17958  Hom_achoma 17959  comp_accoa 17990

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-ot 4591  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-doma 17960  df-coda 17961  df-homa 17962  df-arw 17963  df-coa 17992

This theorem is referenced by:  coa2  18005  coahom  18006  arwlid  18008  arwrid  18009  arwass  18010