MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfrngc2 Structured version   Visualization version   GIF version

Theorem dfrngc2 20713
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.
StepHypRef Expression
1 dfrngc2.c . . 3 𝐶 = (RngCat‘𝑈)
2 dfrngc2.u . . 3 (𝜑𝑈𝑉)
3 dfrngc2.b . . 3 (𝜑𝐵 = (𝑈 ∩ Rng))
4 dfrngc2.h . . 3 (𝜑𝐻 = ( RngHom ↾ (𝐵 × 𝐵)))
51, 2, 3, 4rngcval 20703 . 2 (𝜑𝐶 = ((ExtStrCat‘𝑈) ↾cat 𝐻))
6 eqid 2769 . . 3 ((ExtStrCat‘𝑈) ↾cat 𝐻) = ((ExtStrCat‘𝑈) ↾cat 𝐻)
7 fvexd 6897 . . 3 (𝜑 → (ExtStrCat‘𝑈) ∈ V)
8 inex1g 5290 . . . . 5 (𝑈𝑉 → (𝑈 ∩ Rng) ∈ V)
92, 8syl 18 . . . 4 (𝜑 → (𝑈 ∩ Rng) ∈ V)
103, 9eqeltrd 2869 . . 3 (𝜑𝐵 ∈ V)
113, 4rnghmresfn 20704 . . 3 (𝜑𝐻 Fn (𝐵 × 𝐵))
126, 7, 10, 11rescval2 17885 . 2 (𝜑 → ((ExtStrCat‘𝑈) ↾cat 𝐻) = (((ExtStrCat‘𝑈) ↾s 𝐵) sSet ⟨(Hom ‘ndx), 𝐻⟩))
13 eqid 2769 . . . 4 (ExtStrCat‘𝑈) = (ExtStrCat‘𝑈)
14 eqidd 2770 . . . 4 (𝜑 → (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) = (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
15 dfrngc2.o . . . . 5 (𝜑· = (comp‘(ExtStrCat‘𝑈)))
16 eqid 2769 . . . . . 6 (comp‘(ExtStrCat‘𝑈)) = (comp‘(ExtStrCat‘𝑈))
1713, 2, 16estrccofval 18185 . . . . 5 (𝜑 → (comp‘(ExtStrCat‘𝑈)) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓))))
1815, 17eqtrd 2804 . . . 4 (𝜑· = (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓))))
1913, 2, 14, 18estrcval 18180 . . 3 (𝜑 → (ExtStrCat‘𝑈) = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))⟩, ⟨(comp‘ndx), · ⟩})
20 mpoexga 8074 . . . 4 ((𝑈𝑉𝑈𝑉) → (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ∈ V)
212, 2, 20syl2anc 595 . . 3 (𝜑 → (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ∈ V)
22 fvexd 6897 . . . 4 (𝜑 → (comp‘(ExtStrCat‘𝑈)) ∈ V)
2315, 22eqeltrd 2869 . . 3 (𝜑· ∈ V)
24 rnghmfn 20521 . . . . . 6 RngHom Fn (Rng × Rng)
25 fnfun 6636 . . . . . 6 ( RngHom Fn (Rng × Rng) → Fun RngHom )
2624, 25mp1i 14 . . . . 5 (𝜑 → Fun RngHom )
27 sqxpexg 7754 . . . . . 6 (𝐵 ∈ V → (𝐵 × 𝐵) ∈ V)
2810, 27syl 18 . . . . 5 (𝜑 → (𝐵 × 𝐵) ∈ V)
29 resfunexg 7214 . . . . 5 ((Fun RngHom ∧ (𝐵 × 𝐵) ∈ V) → ( RngHom ↾ (𝐵 × 𝐵)) ∈ V)
3026, 28, 29syl2anc 595 . . . 4 (𝜑 → ( RngHom ↾ (𝐵 × 𝐵)) ∈ V)
314, 30eqeltrd 2869 . . 3 (𝜑𝐻 ∈ V)
32 inss1 4195 . . . 4 (𝑈 ∩ Rng) ⊆ 𝑈
333, 32eqsstrdi 3987 . . 3 (𝜑𝐵𝑈)
3419, 2, 21, 23, 31, 33estrres 18195 . 2 (𝜑 → (((ExtStrCat‘𝑈) ↾s 𝐵) sSet ⟨(Hom ‘ndx), 𝐻⟩) = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
355, 12, 343eqtrd 2808 1 (𝜑𝐶 = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  Vcvv 3461  cin 3910  {ctp 4596  cop 4598   × cxp 5660  cres 5664  ccom 5666  Fun wfun 6531   Fn wfn 6532  cfv 6537  (class class class)co 7411  cmpo 7413  1st c1st 7984  2nd c2nd 7985  m cmap 8824   sSet csts 17223  ndxcnx 17253  Basecbs 17269  s cress 17290  Hom chom 17321  compcco 17322  cat cresc 17865  ExtStrCatcestrc 18178  Rngcrng 20230   RngHom crnghm 20516  RngCatcrngc 20701
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3376  df-rab 3423  df-v 3463  df-sbc 3752  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-tp 4597  df-op 4599  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  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 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-er 8694  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-nn 12234  df-2 12303  df-3 12304  df-4 12305  df-5 12306  df-6 12307  df-7 12308  df-8 12309  df-9 12310  df-n0 12505  df-z 12592  df-dec 12712  df-uz 12863  df-fz 13536  df-struct 17207  df-sets 17224  df-slot 17242  df-ndx 17254  df-base 17270  df-ress 17291  df-hom 17334  df-cco 17335  df-resc 17868  df-estrc 18179  df-rnghm 20518  df-rngc 20702
This theorem is referenced by:  rngcresringcat  20754
  Copyright terms: Public domain W3C validator