Theorem coafval 16537

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 6103	. . . . . 6 ⊢ (𝑐 = 𝐶 → (Arrow‘𝑐) = (Arrow‘𝐶))
3		coafval.a	. . . . . 6 ⊢ 𝐴 = (Arrow‘𝐶)
4	2, 3	syl6eqr 2662	. . . . 5 ⊢ (𝑐 = 𝐶 → (Arrow‘𝑐) = 𝐴)
5	4	rabeqdv 3167	. . . . 5 ⊢ (𝑐 = 𝐶 → {ℎ ∈ (Arrow‘𝑐) ∣ (coda‘ℎ) = (doma‘𝑔)} = {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)})
6		fveq2 6103	. . . . . . . . 9 ⊢ (𝑐 = 𝐶 → (comp‘𝑐) = (comp‘𝐶))
7		coafval.x	. . . . . . . . 9 ⊢ ∙ = (comp‘𝐶)
8	6, 7	syl6eqr 2662	. . . . . . . 8 ⊢ (𝑐 = 𝐶 → (comp‘𝑐) = ∙ )
9	8	oveqd 6566	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (⟨(doma‘𝑓), (doma‘𝑔)⟩(comp‘𝑐)(coda‘𝑔)) = (⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔)))
10	9	oveqd 6566	. . . . . 6 ⊢ (𝑐 = 𝐶 → ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩(comp‘𝑐)(coda‘𝑔))(2nd ‘𝑓)) = ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓)))
11	10	oteq3d 4354	. . . . 5 ⊢ (𝑐 = 𝐶 → ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩(comp‘𝑐)(coda‘𝑔))(2nd ‘𝑓))⟩ = ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩)
12	4, 5, 11	mpt2eq123dv 6615	. . . 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 16529	. . . 4 ⊢ compa = (𝑐 ∈ Cat ↦ (𝑔 ∈ (Arrow‘𝑐), 𝑓 ∈ {ℎ ∈ (Arrow‘𝑐) ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩(comp‘𝑐)(coda‘𝑔))(2nd ‘𝑓))⟩))
14		fvex 6113	. . . . . 6 ⊢ (Arrow‘𝐶) ∈ V
15	3, 14	eqeltri 2684	. . . . 5 ⊢ 𝐴 ∈ V
16	15	rabex 4740	. . . . 5 ⊢ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ∈ V
17	15, 16	mpt2ex 7136	. . . 4 ⊢ (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩) ∈ V
18	12, 13, 17	fvmpt 6191	. . 3 ⊢ (𝐶 ∈ Cat → (compa‘𝐶) = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩))
19	13	dmmptss 5548	. . . . . . 7 ⊢ dom compa ⊆ Cat
20	19	sseli 3564	. . . . . 6 ⊢ (𝐶 ∈ dom compa → 𝐶 ∈ Cat)
21	20	con3i 149	. . . . 5 ⊢ (¬ 𝐶 ∈ Cat → ¬ 𝐶 ∈ dom compa)
22		ndmfv 6128	. . . . 5 ⊢ (¬ 𝐶 ∈ dom compa → (compa‘𝐶) = ∅)
23	21, 22	syl 17	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → (compa‘𝐶) = ∅)
24	3	arwrcl 16517	. . . . . . . 8 ⊢ (𝑓 ∈ 𝐴 → 𝐶 ∈ Cat)
25	24	con3i 149	. . . . . . 7 ⊢ (¬ 𝐶 ∈ Cat → ¬ 𝑓 ∈ 𝐴)
26	25	eq0rdv 3931	. . . . . 6 ⊢ (¬ 𝐶 ∈ Cat → 𝐴 = ∅)
27		eqidd 2611	. . . . . 6 ⊢ (¬ 𝐶 ∈ Cat → {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} = {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)})
28		eqidd 2611	. . . . . 6 ⊢ (¬ 𝐶 ∈ Cat → ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩ = ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩)
29	26, 27, 28	mpt2eq123dv 6615	. . . . 5 ⊢ (¬ 𝐶 ∈ Cat → (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩) = (𝑔 ∈ ∅, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩))
30		mpt20 6623	. . . . 5 ⊢ (𝑔 ∈ ∅, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩) = ∅
31	29, 30	syl6eq 2660	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩) = ∅)
32	23, 31	eqtr4d 2647	. . 3 ⊢ (¬ 𝐶 ∈ Cat → (compa‘𝐶) = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩))
33	18, 32	pm2.61i 175	. 2 ⊢ (compa‘𝐶) = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩)
34	1, 33	eqtri 2632	1 ⊢ · = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩ ∙ (coda‘𝑔))(2nd ‘𝑓))⟩)

Syntax hints:  ¬ wn 3   = wceq 1475   ∈ wcel 1977  {crab 2900  Vcvv 3173  ∅c0 3874  ⟨cop 4131  ⟨cotp 4133  dom cdm 5038  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  2^nd c2nd 7058  compcco 15780  Catccat 16148  dom_acdoma 16493  cod_accoda 16494  Arrowcarw 16495  comp_accoa 16527

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-ot 4134  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-arw 16500  df-coa 16529

This theorem is referenced by:  eldmcoa  16538  dmcoass  16539  coaval  16541  coapm  16544