Theorem rngccofvalALTV 48114

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 48110	. . . 4 ⊢ (𝜑 → 𝐵 = (𝑈 ∩ Rng))
5		eqid 2735	. . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
6	1, 3, 2, 5	rngchomfvalALTV 48111	. . . 4 ⊢ (𝜑 → (Hom ‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 RngHom 𝑦)))
7		eqidd 2736	. . . 4 ⊢ (𝜑 → (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
8	1, 2, 4, 6, 7	rngcvalALTV 48109	. . 3 ⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩})
9	8	fveq2d 6911	. 2 ⊢ (𝜑 → (comp‘𝐶) = (comp‘{⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩}))
10		rngccofvalALTV.o	. 2 ⊢ · = (comp‘𝐶)
11	3	fvexi 6921	. . . . 5 ⊢ 𝐵 ∈ V
12		sqxpexg 7774	. . . . 5 ⊢ (𝐵 ∈ V → (𝐵 × 𝐵) ∈ V)
13	11, 12	ax-mp 5	. . . 4 ⊢ (𝐵 × 𝐵) ∈ V
14	13, 11	mpoex 8103	. . 3 ⊢ (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) ∈ V
15		catstr 18013	. . . 4 ⊢ {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩} Struct ⟨1, ;15⟩
16		ccoid 17460	. . . 4 ⊢ comp = Slot (comp‘ndx)
17		snsstp3 4823	. . . 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 17238	. . 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 2800	1 ⊢ (𝜑 → · = (𝑣 ∈ (𝐵 × 𝐵), 𝑧 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑣) RngHom 𝑧), 𝑓 ∈ ((1st ‘𝑣) RngHom (2nd ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2106  Vcvv 3478  {ctp 4635  ⟨cop 4637   × cxp 5687   ∘ ccom 5693  ‘cfv 6563  (class class class)co 7431   ∈ cmpo 7433  1^st c1st 8011  2^nd c2nd 8012  1c1 11154  5c5 12322  ;cdc 12731  ndxcnx 17227  Basecbs 17245  Hom chom 17309  compcco 17310   RngHom crnghm 20451  RngCatALTVcrngcALTV 48107

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-tp 4636  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-nn 12265  df-2 12327  df-3 12328  df-4 12329  df-5 12330  df-6 12331  df-7 12332  df-8 12333  df-9 12334  df-n0 12525  df-z 12612  df-dec 12732  df-uz 12877  df-fz 13545  df-struct 17181  df-slot 17216  df-ndx 17228  df-base 17246  df-hom 17322  df-cco 17323  df-rngcALTV 48108

This theorem is referenced by:  rngccoALTV  48115