Theorem coafval 16714

Description: The value of the composition of arrows. (Contributed by Mario Carneiro, 11-Jan-2017.)

Hypotheses

Ref	Expression
coafval.o	⊢ · = (compa‘𝐶)
coafval.a	⊢ 𝐴 = (Arrow‘𝐶)
coafval.x	⊢ ∙ = (comp‘𝐶)

Assertion

Ref	Expression
coafval	⊢ · = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩)

Distinct variable groups:   𝑓,𝑔,ℎ,𝐴   𝐶,𝑓,𝑔,ℎ

Allowed substitution hints:   ∙ (𝑓,𝑔,ℎ)   · (𝑓,𝑔,ℎ)

Proof of Theorem coafval

Dummy variable 𝑐 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		coafval.o	. 2 ⊢ · = (compa‘𝐶)
2		fveq2 6191	. . . . . 6 ⊢ (𝑐 = 𝐶 → (Arrow‘𝑐) = (Arrow‘𝐶))
3		coafval.a	. . . . . 6 ⊢ 𝐴 = (Arrow‘𝐶)
4	2, 3	syl6eqr 2674	. . . . 5 ⊢ (𝑐 = 𝐶 → (Arrow‘𝑐) = 𝐴)
5	4	rabeqdv 3194	. . . . 5 ⊢ (𝑐 = 𝐶 → {ℎ ∈ (Arrow‘𝑐) ∣ (coda‘ℎ) = (doma‘𝑔)} = {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)})
6		fveq2 6191	. . . . . . . . 9 ⊢ (𝑐 = 𝐶 → (comp‘𝑐) = (comp‘𝐶))
7		coafval.x	. . . . . . . . 9 ⊢ ∙ = (comp‘𝐶)
8	6, 7	syl6eqr 2674	. . . . . . . 8 ⊢ (𝑐 = 𝐶 → (comp‘𝑐) = ∙ )
9	8	oveqd 6667	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (⟨(doma‘𝑓), (doma‘𝑔)⟩(comp‘𝑐)(coda‘𝑔)) = (⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔)))
10	9	oveqd 6667	. . . . . 6 ⊢ (𝑐 = 𝐶 → ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩(comp‘𝑐)(coda‘𝑔))(2nd ‘𝑓)) = ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓)))
11	10	oteq3d 4416	. . . . 5 ⊢ (𝑐 = 𝐶 → ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩(comp‘𝑐)(coda‘𝑔))(2nd ‘𝑓))⟩ = ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩)
12	4, 5, 11	mpt2eq123dv 6717	. . . 4 ⊢ (𝑐 = 𝐶 → (𝑔 ∈ (Arrow‘𝑐), 𝑓 ∈ {ℎ ∈ (Arrow‘𝑐) ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩(comp‘𝑐)(coda‘𝑔))(2nd ‘𝑓))⟩) = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩))
13		df-coa 16706	. . . 4 ⊢ compa = (𝑐 ∈ Cat ↦ (𝑔 ∈ (Arrow‘𝑐), 𝑓 ∈ {ℎ ∈ (Arrow‘𝑐) ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩(comp‘𝑐)(coda‘𝑔))(2nd ‘𝑓))⟩))
14		fvex 6201	. . . . . 6 ⊢ (Arrow‘𝐶) ∈ V
15	3, 14	eqeltri 2697	. . . . 5 ⊢ 𝐴 ∈ V
16	15	rabex 4813	. . . . 5 ⊢ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ∈ V
17	15, 16	mpt2ex 7247	. . . 4 ⊢ (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩) ∈ V
18	12, 13, 17	fvmpt 6282	. . 3 ⊢ (𝐶 ∈ Cat → (compa‘𝐶) = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩))
19	13	dmmptss 5631	. . . . . . 7 ⊢ dom compa ⊆ Cat
20	19	sseli 3599	. . . . . 6 ⊢ (𝐶 ∈ dom compa → 𝐶 ∈ Cat)
21	20	con3i 150	. . . . 5 ⊢ (¬ 𝐶 ∈ Cat → ¬ 𝐶 ∈ dom compa)
22		ndmfv 6218	. . . . 5 ⊢ (¬ 𝐶 ∈ dom compa → (compa‘𝐶) = ∅)
23	21, 22	syl 17	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → (compa‘𝐶) = ∅)
24	3	arwrcl 16694	. . . . . . . 8 ⊢ (𝑓 ∈ 𝐴 → 𝐶 ∈ Cat)
25	24	con3i 150	. . . . . . 7 ⊢ (¬ 𝐶 ∈ Cat → ¬ 𝑓 ∈ 𝐴)
26	25	eq0rdv 3979	. . . . . 6 ⊢ (¬ 𝐶 ∈ Cat → 𝐴 = ∅)
27		eqidd 2623	. . . . . 6 ⊢ (¬ 𝐶 ∈ Cat → {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} = {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)})
28		eqidd 2623	. . . . . 6 ⊢ (¬ 𝐶 ∈ Cat → ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩ = ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩)
29	26, 27, 28	mpt2eq123dv 6717	. . . . 5 ⊢ (¬ 𝐶 ∈ Cat → (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩) = (𝑔 ∈ ∅, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩))
30		mpt20 6725	. . . . 5 ⊢ (𝑔 ∈ ∅, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩) = ∅
31	29, 30	syl6eq 2672	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩) = ∅)
32	23, 31	eqtr4d 2659	. . 3 ⊢ (¬ 𝐶 ∈ Cat → (compa‘𝐶) = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩))
33	18, 32	pm2.61i 176	. 2 ⊢ (compa‘𝐶) = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩)
34	1, 33	eqtri 2644	1 ⊢ · = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩)

Syntax hints:  ¬ wn 3   = wceq 1483   ∈ wcel 1990  {crab 2916  Vcvv 3200  ∅c0 3915  ⟨cop 4183  ⟨cotp 4185  dom cdm 5114  ‘cfv 5888  (class class class)co 6650   ↦ cmpt2 6652  2^nd c2nd 7167  compcco 15953  Catccat 16325  dom_acdoma 16670  cod_accoda 16671  Arrowcarw 16672  comp_accoa 16704

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-ot 4186  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-arw 16677  df-coa 16706

This theorem is referenced by:  eldmcoa  16715  dmcoass  16716  coaval  16718  coapm  16721