Theorem dfrngc2 20827

Description: Alternate definition of the category of non-unital rings (in a universe). (Contributed by AV, 16-Mar-2020.)

Hypotheses

Ref	Expression
dfrngc2.c	⊢ 𝐶 = (RngCat‘𝑈)
dfrngc2.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
dfrngc2.b	⊢ (𝜑 → 𝐵 = (𝑈 ∩ Rng))
dfrngc2.h	⊢ (𝜑 → 𝐻 = ( RngHom ↾ (𝐵 × 𝐵)))
dfrngc2.o	⊢ (𝜑 → · = (comp‘(ExtStrCat‘𝑈)))

Assertion

Ref	Expression
dfrngc2	⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})

Proof of Theorem dfrngc2

Dummy variables 𝑓 𝑔 𝑣 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfrngc2.c	. . 3 ⊢ 𝐶 = (RngCat‘𝑈)
2		dfrngc2.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
3		dfrngc2.b	. . 3 ⊢ (𝜑 → 𝐵 = (𝑈 ∩ Rng))
4		dfrngc2.h	. . 3 ⊢ (𝜑 → 𝐻 = ( RngHom ↾ (𝐵 × 𝐵)))
5	1, 2, 3, 4	rngcval 20817	. 2 ⊢ (𝜑 → 𝐶 = ((ExtStrCat‘𝑈) ↾cat 𝐻))
6		eqid 2760	. . 3 ⊢ ((ExtStrCat‘𝑈) ↾cat 𝐻) = ((ExtStrCat‘𝑈) ↾cat 𝐻)
7		fvexd 6889	. . 3 ⊢ (𝜑 → (ExtStrCat‘𝑈) ∈ V)
8		inex1g 5279	. . . . 5 ⊢ (𝑈 ∈ 𝑉 → (𝑈 ∩ Rng) ∈ V)
9	2, 8	syl 18	. . . 4 ⊢ (𝜑 → (𝑈 ∩ Rng) ∈ V)
10	3, 9	eqeltrd 2860	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
11	3, 4	rnghmresfn 20818	. . 3 ⊢ (𝜑 → 𝐻 Fn (𝐵 × 𝐵))
12	6, 7, 10, 11	rescval2 17950	. 2 ⊢ (𝜑 → ((ExtStrCat‘𝑈) ↾cat 𝐻) = (((ExtStrCat‘𝑈) ↾s 𝐵) sSet ⟨(Hom ‘ndx), 𝐻⟩))
13		eqid 2760	. . . 4 ⊢ (ExtStrCat‘𝑈) = (ExtStrCat‘𝑈)
14		eqidd 2761	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
15		dfrngc2.o	. . . . 5 ⊢ (𝜑 → · = (comp‘(ExtStrCat‘𝑈)))
16		eqid 2760	. . . . . 6 ⊢ (comp‘(ExtStrCat‘𝑈)) = (comp‘(ExtStrCat‘𝑈))
17	13, 2, 16	estrccofval 18250	. . . . 5 ⊢ (𝜑 → (comp‘(ExtStrCat‘𝑈)) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd ‘𝑣))), 𝑓 ∈ ((Base‘(2nd ‘𝑣)) ↑m (Base‘(1st ‘𝑣))) ↦ (𝑔 ∘ 𝑓))))
18	15, 17	eqtrd 2795	. . . 4 ⊢ (𝜑 → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd ‘𝑣))), 𝑓 ∈ ((Base‘(2nd ‘𝑣)) ↑m (Base‘(1st ‘𝑣))) ↦ (𝑔 ∘ 𝑓))))
19	13, 2, 14, 18	estrcval 18245	. . 3 ⊢ (𝜑 → (ExtStrCat‘𝑈) = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))⟩, ⟨(comp‘ndx), · ⟩})
20		mpoexga 8074	. . . 4 ⊢ ((𝑈 ∈ 𝑉 ∧ 𝑈 ∈ 𝑉) → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ∈ V)
21	2, 2, 20	syl2anc 596	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ∈ V)
22		fvexd 6889	. . . 4 ⊢ (𝜑 → (comp‘(ExtStrCat‘𝑈)) ∈ V)
23	15, 22	eqeltrd 2860	. . 3 ⊢ (𝜑 → · ∈ V)
24		rnghmfn 20616	. . . . . 6 ⊢ RngHom Fn (Rng × Rng)
25		fnfun 6628	. . . . . 6 ⊢ ( RngHom Fn (Rng × Rng) → Fun RngHom )
26	24, 25	mp1i 14	. . . . 5 ⊢ (𝜑 → Fun RngHom )
27		sqxpexg 7753	. . . . . 6 ⊢ (𝐵 ∈ V → (𝐵 × 𝐵) ∈ V)
28	10, 27	syl 18	. . . . 5 ⊢ (𝜑 → (𝐵 × 𝐵) ∈ V)
29		resfunexg 7210	. . . . 5 ⊢ ((Fun RngHom ∧ (𝐵 × 𝐵) ∈ V) → ( RngHom ↾ (𝐵 × 𝐵)) ∈ V)
30	26, 28, 29	syl2anc 596	. . . 4 ⊢ (𝜑 → ( RngHom ↾ (𝐵 × 𝐵)) ∈ V)
31	4, 30	eqeltrd 2860	. . 3 ⊢ (𝜑 → 𝐻 ∈ V)
32		inss1 4182	. . . 4 ⊢ (𝑈 ∩ Rng) ⊆ 𝑈
33	3, 32	eqsstrdi 3975	. . 3 ⊢ (𝜑 → 𝐵 ⊆ 𝑈)
34	19, 2, 21, 23, 31, 33	estrres 18260	. 2 ⊢ (𝜑 → (((ExtStrCat‘𝑈) ↾s 𝐵) sSet ⟨(Hom ‘ndx), 𝐻⟩) = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
35	5, 12, 34	3eqtrd 2799	1 ⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ∩ cin 3898  {ctp 4588  ⟨cop 4590   × cxp 5646   ↾ cres 5650   ∘ ccom 5652  Fun wfun 6522   Fn wfn 6523  ‘cfv 6528  (class class class)co 7409   ∈ cmpo 7411  1^st c1st 7983  2^nd c2nd 7984   ↑_m cmap 8826   sSet csts 17288  ndxcnx 17318  Basecbs 17334   ↾_s cress 17355  Hom chom 17386  compcco 17387   ↾_cat cresc 17930  ExtStrCatcestrc 18243  Rngcrng 20321   RngHom crnghm 20611  RngCatcrngc 20815

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7735  ax-cnex 11213  ax-resscn 11214  ax-1cn 11215  ax-icn 11216  ax-addcl 11217  ax-addrcl 11218  ax-mulcl 11219  ax-mulrcl 11220  ax-mulcom 11221  ax-addass 11222  ax-mulass 11223  ax-distr 11224  ax-i2m1 11225  ax-1ne0 11226  ax-1rid 11227  ax-rnegex 11228  ax-rrecex 11229  ax-cnre 11230  ax-pre-lttri 11231  ax-pre-lttrn 11232  ax-pre-ltadd 11233  ax-pre-mulgt0 11234

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6294  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-f1 6533  df-fo 6534  df-f1o 6535  df-fv 6536  df-riota 7366  df-ov 7412  df-oprab 7413  df-mpo 7414  df-om 7862  df-1st 7985  df-2nd 7986  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8455  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-pnf 11302  df-mnf 11303  df-xr 11304  df-ltxr 11305  df-le 11306  df-sub 11500  df-neg 11501  df-nn 12291  df-2 12360  df-3 12361  df-4 12362  df-5 12363  df-6 12364  df-7 12365  df-8 12366  df-9 12367  df-n0 12562  df-z 12649  df-dec 12770  df-uz 12921  df-fz 13595  df-struct 17272  df-sets 17289  df-slot 17307  df-ndx 17319  df-base 17335  df-ress 17356  df-hom 17399  df-cco 17400  df-resc 17933  df-estrc 18244  df-rnghm 20613  df-rngc 20816

This theorem is used by:  rngcresringcat  20868