Theorem rngccofvalALTV 49640

Description: Composition in the category of non-unital rings. (New usage is discouraged.) (Contributed by AV, 27-Feb-2020.)

Hypotheses

Ref	Expression
rngcbasALTV.c	⊢ 𝐶 = (RngCatALTV‘𝑈)
rngcbasALTV.b	⊢ 𝐵 = (Base‘𝐶)
rngcbasALTV.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
rngccofvalALTV.o	⊢ · = (comp‘𝐶)

Assertion

Ref	Expression
rngccofvalALTV	⊢ (𝜑 → · = (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))

Distinct variable groups:   𝑓,𝑔,𝑣,𝑧   𝑣,𝑈,𝑧   𝜑,𝑣,𝑧   𝑣,𝐵,𝑧

Allowed substitution hints:   𝜑(𝑓, 𝑔)   𝐵(𝑓, 𝑔)   𝐶(𝑧, 𝑣, 𝑓, 𝑔)   · (𝑧, 𝑣, 𝑓, 𝑔)   𝑈(𝑓, 𝑔)   𝑉(𝑧, 𝑣, 𝑓, 𝑔)

Proof of Theorem rngccofvalALTV

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rngcbasALTV.c	. . . 4 ⊢ 𝐶 = (RngCatALTV‘𝑈)
2		rngcbasALTV.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
3		rngcbasALTV.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐶)
4	1, 3, 2	rngcbasALTV 49636	. . . 4 ⊢ (𝜑 → 𝐵 = (𝑈 ∩ Rng))
5		eqid 2763	. . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
6	1, 3, 2, 5	rngchomfvalALTV 49637	. . . 4 ⊢ (𝜑 → (Hom ‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 RngHom 𝑦)))
7		eqidd 2764	. . . 4 ⊢ (𝜑 → (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
8	1, 2, 4, 6, 7	rngcvalALTV 49635	. . 3 ⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩})
9	8	fveq2d 6920	. 2 ⊢ (𝜑 → (comp‘𝐶) = (comp‘{⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩}))
10		rngccofvalALTV.o	. 2 ⊢ · = (comp‘𝐶)
11	3	fvexi 6930	. . . . 5 ⊢ 𝐵 ∈ V
12		sqxpexg 7801	. . . . 5 ⊢ (𝐵 ∈ V → (𝐵 × 𝐵) ∈ V)
13	11, 12	ax-mp 5	. . . 4 ⊢ (𝐵 × 𝐵) ∈ V
14	13, 11	mpoex 8127	. . 3 ⊢ (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) ∈ V
15		catstr 18185	. . . 4 ⊢ {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩} Struct ⟨1, ;15⟩
16		ccoid 17631	. . . 4 ⊢ comp = Slot (comp‘ndx)
17		snsstp3 4779	. . . 4 ⊢ {⟨(comp‘ndx), (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩} ⊆ {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩}
18	15, 16, 17	strfv 17425	. . 3 ⊢ ((𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) ∈ V → (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = (comp‘{⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩}))
19	14, 18	ax-mp 5	. 2 ⊢ (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = (comp‘{⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩})
20	9, 10, 19	3eqtr4g 2823	1 ⊢ (𝜑 → · = (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454  {ctp 4592  ⟨cop 4840   × cxp 5656   ∘ ccom 5662  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1^st c1st 8033  2^nd c2nd 8034  1c1 11240  5c5 12440  ;cdc 12854  ndxcnx 17415  Basecbs 17431  Hom chom 17483  compcco 17484   RngHom crnghm 20715  RngCatALTVcrngcALTV 49633

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-3 12446  df-4 12447  df-5 12448  df-6 12449  df-7 12450  df-8 12451  df-9 12452  df-n0 12647  df-z 12734  df-dec 12855  df-uz 13006  df-fz 13680  df-struct 17369  df-slot 17404  df-ndx 17416  df-base 17432  df-hom 17497  df-cco 17498  df-rngcALTV 49634

This theorem is used by:  rngccoALTV  49641