Theorem dfrngc2 20791

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 20781	. 2 ⊢ (𝜑 → 𝐶 = ((ExtStrCat‘𝑈) ↾cat 𝐻))
6		eqid 2762	. . 3 ⊢ ((ExtStrCat‘𝑈) ↾cat 𝐻) = ((ExtStrCat‘𝑈) ↾cat 𝐻)
7		fvexd 6897	. . 3 ⊢ (𝜑 → (ExtStrCat‘𝑈) ∈ V)
8		inex1g 5286	. . . . 5 ⊢ (𝑈 ∈ 𝑉 → (𝑈 ∩ Rng) ∈ V)
9	2, 8	syl 18	. . . 4 ⊢ (𝜑 → (𝑈 ∩ Rng) ∈ V)
10	3, 9	eqeltrd 2862	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
11	3, 4	rnghmresfn 20782	. . 3 ⊢ (𝜑 → 𝐻 Fn (𝐵 × 𝐵))
12	6, 7, 10, 11	rescval2 17921	. 2 ⊢ (𝜑 → ((ExtStrCat‘𝑈) ↾cat 𝐻) = (((ExtStrCat‘𝑈) ↾s 𝐵) sSet ⟨(Hom ‘ndx), 𝐻⟩))
13		eqid 2762	. . . 4 ⊢ (ExtStrCat‘𝑈) = (ExtStrCat‘𝑈)
14		eqidd 2763	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
15		dfrngc2.o	. . . . 5 ⊢ (𝜑 → · = (comp‘(ExtStrCat‘𝑈)))
16		eqid 2762	. . . . . 6 ⊢ (comp‘(ExtStrCat‘𝑈)) = (comp‘(ExtStrCat‘𝑈))
17	13, 2, 16	estrccofval 18221	. . . . 5 ⊢ (𝜑 → (comp‘(ExtStrCat‘𝑈)) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd ‘𝑣))), 𝑓 ∈ ((Base‘(2nd ‘𝑣)) ↑m (Base‘(1st ‘𝑣))) ↦ (𝑔 ∘ 𝑓))))
18	15, 17	eqtrd 2797	. . . 4 ⊢ (𝜑 → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd ‘𝑣))), 𝑓 ∈ ((Base‘(2nd ‘𝑣)) ↑m (Base‘(1st ‘𝑣))) ↦ (𝑔 ∘ 𝑓))))
19	13, 2, 14, 18	estrcval 18216	. . 3 ⊢ (𝜑 → (ExtStrCat‘𝑈) = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))⟩, ⟨(comp‘ndx), · ⟩})
20		mpoexga 8079	. . . 4 ⊢ ((𝑈 ∈ 𝑉 ∧ 𝑈 ∈ 𝑉) → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ∈ V)
21	2, 2, 20	syl2anc 596	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ∈ V)
22		fvexd 6897	. . . 4 ⊢ (𝜑 → (comp‘(ExtStrCat‘𝑈)) ∈ V)
23	15, 22	eqeltrd 2862	. . 3 ⊢ (𝜑 → · ∈ V)
24		rnghmfn 20581	. . . . . 6 ⊢ RngHom Fn (Rng × Rng)
25		fnfun 6636	. . . . . 6 ⊢ ( RngHom Fn (Rng × Rng) → Fun RngHom )
26	24, 25	mp1i 14	. . . . 5 ⊢ (𝜑 → Fun RngHom )
27		sqxpexg 7757	. . . . . 6 ⊢ (𝐵 ∈ V → (𝐵 × 𝐵) ∈ V)
28	10, 27	syl 18	. . . . 5 ⊢ (𝜑 → (𝐵 × 𝐵) ∈ V)
29		resfunexg 7217	. . . . 5 ⊢ ((Fun RngHom ∧ (𝐵 × 𝐵) ∈ V) → ( RngHom ↾ (𝐵 × 𝐵)) ∈ V)
30	26, 28, 29	syl2anc 596	. . . 4 ⊢ (𝜑 → ( RngHom ↾ (𝐵 × 𝐵)) ∈ V)
31	4, 30	eqeltrd 2862	. . 3 ⊢ (𝜑 → 𝐻 ∈ V)
32		inss1 4185	. . . 4 ⊢ (𝑈 ∩ Rng) ⊆ 𝑈
33	3, 32	eqsstrdi 3978	. . 3 ⊢ (𝜑 → 𝐵 ⊆ 𝑈)
34	19, 2, 21, 23, 31, 33	estrres 18231	. 2 ⊢ (𝜑 → (((ExtStrCat‘𝑈) ↾s 𝐵) sSet ⟨(Hom ‘ndx), 𝐻⟩) = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
35	5, 12, 34	3eqtrd 2801	1 ⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ∩ cin 3901  {ctp 4591  ⟨cop 4593   × cxp 5657   ↾ cres 5661   ∘ ccom 5663  Fun wfun 6531   Fn wfn 6532  ‘cfv 6537  (class class class)co 7416   ∈ cmpo 7418  1^st c1st 7987  2^nd c2nd 7988   ↑_m cmap 8829   sSet csts 17259  ndxcnx 17289  Basecbs 17305   ↾_s cress 17326  Hom chom 17357  compcco 17358   ↾_cat cresc 17901  ExtStrCatcestrc 18214  Rngcrng 20288   RngHom crnghm 20576  RngCatcrngc 20779

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-nn 12261  df-2 12330  df-3 12331  df-4 12332  df-5 12333  df-6 12334  df-7 12335  df-8 12336  df-9 12337  df-n0 12532  df-z 12619  df-dec 12740  df-uz 12891  df-fz 13564  df-struct 17243  df-sets 17260  df-slot 17278  df-ndx 17290  df-base 17306  df-ress 17327  df-hom 17370  df-cco 17371  df-resc 17904  df-estrc 18215  df-rnghm 20578  df-rngc 20780

This theorem is used by:  rngcresringcat  20832