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

Theorem dfrngc2 20520
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 20510 . 2 (𝜑𝐶 = ((ExtStrCat‘𝑈) ↾cat 𝐻))
6 eqid 2731 . . 3 ((ExtStrCat‘𝑈) ↾cat 𝐻) = ((ExtStrCat‘𝑈) ↾cat 𝐻)
7 fvexd 6906 . . 3 (𝜑 → (ExtStrCat‘𝑈) ∈ V)
8 inex1g 5319 . . . . 5 (𝑈𝑉 → (𝑈 ∩ Rng) ∈ V)
92, 8syl 17 . . . 4 (𝜑 → (𝑈 ∩ Rng) ∈ V)
103, 9eqeltrd 2832 . . 3 (𝜑𝐵 ∈ V)
113, 4rnghmresfn 20511 . . 3 (𝜑𝐻 Fn (𝐵 × 𝐵))
126, 7, 10, 11rescval2 17782 . 2 (𝜑 → ((ExtStrCat‘𝑈) ↾cat 𝐻) = (((ExtStrCat‘𝑈) ↾s 𝐵) sSet ⟨(Hom ‘ndx), 𝐻⟩))
13 eqid 2731 . . . 4 (ExtStrCat‘𝑈) = (ExtStrCat‘𝑈)
14 eqidd 2732 . . . 4 (𝜑 → (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) = (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
15 dfrngc2.o . . . . 5 (𝜑· = (comp‘(ExtStrCat‘𝑈)))
16 eqid 2731 . . . . . 6 (comp‘(ExtStrCat‘𝑈)) = (comp‘(ExtStrCat‘𝑈))
1713, 2, 16estrccofval 18090 . . . . 5 (𝜑 → (comp‘(ExtStrCat‘𝑈)) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓))))
1815, 17eqtrd 2771 . . . 4 (𝜑· = (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓))))
1913, 2, 14, 18estrcval 18085 . . 3 (𝜑 → (ExtStrCat‘𝑈) = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))⟩, ⟨(comp‘ndx), · ⟩})
20 mpoexga 8068 . . . 4 ((𝑈𝑉𝑈𝑉) → (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ∈ V)
212, 2, 20syl2anc 583 . . 3 (𝜑 → (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ∈ V)
22 fvexd 6906 . . . 4 (𝜑 → (comp‘(ExtStrCat‘𝑈)) ∈ V)
2315, 22eqeltrd 2832 . . 3 (𝜑· ∈ V)
24 rnghmfn 20337 . . . . . 6 RngHom Fn (Rng × Rng)
25 fnfun 6649 . . . . . 6 ( RngHom Fn (Rng × Rng) → Fun RngHom )
2624, 25mp1i 13 . . . . 5 (𝜑 → Fun RngHom )
27 sqxpexg 7746 . . . . . 6 (𝐵 ∈ V → (𝐵 × 𝐵) ∈ V)
2810, 27syl 17 . . . . 5 (𝜑 → (𝐵 × 𝐵) ∈ V)
29 resfunexg 7219 . . . . 5 ((Fun RngHom ∧ (𝐵 × 𝐵) ∈ V) → ( RngHom ↾ (𝐵 × 𝐵)) ∈ V)
3026, 28, 29syl2anc 583 . . . 4 (𝜑 → ( RngHom ↾ (𝐵 × 𝐵)) ∈ V)
314, 30eqeltrd 2832 . . 3 (𝜑𝐻 ∈ V)
32 inss1 4228 . . . 4 (𝑈 ∩ Rng) ⊆ 𝑈
333, 32eqsstrdi 4036 . . 3 (𝜑𝐵𝑈)
3419, 2, 21, 23, 31, 33estrres 18101 . 2 (𝜑 → (((ExtStrCat‘𝑈) ↾s 𝐵) sSet ⟨(Hom ‘ndx), 𝐻⟩) = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
355, 12, 343eqtrd 2775 1 (𝜑𝐶 = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2105  Vcvv 3473  cin 3947  {ctp 4632  cop 4634   × cxp 5674  cres 5678  ccom 5680  Fun wfun 6537   Fn wfn 6538  cfv 6543  (class class class)co 7412  cmpo 7414  1st c1st 7977  2nd c2nd 7978  m cmap 8826   sSet csts 17103  ndxcnx 17133  Basecbs 17151  s cress 17180  Hom chom 17215  compcco 17216  cat cresc 17762  ExtStrCatcestrc 18083  Rngcrng 20053   RngHom crnghm 20332  RngCatcrngc 20508
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7729  ax-cnex 11172  ax-resscn 11173  ax-1cn 11174  ax-icn 11175  ax-addcl 11176  ax-addrcl 11177  ax-mulcl 11178  ax-mulrcl 11179  ax-mulcom 11180  ax-addass 11181  ax-mulass 11182  ax-distr 11183  ax-i2m1 11184  ax-1ne0 11185  ax-1rid 11186  ax-rnegex 11187  ax-rrecex 11188  ax-cnre 11189  ax-pre-lttri 11190  ax-pre-lttrn 11191  ax-pre-ltadd 11192  ax-pre-mulgt0 11193
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-tp 4633  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7368  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7860  df-1st 7979  df-2nd 7980  df-frecs 8272  df-wrecs 8303  df-recs 8377  df-rdg 8416  df-1o 8472  df-er 8709  df-en 8946  df-dom 8947  df-sdom 8948  df-fin 8949  df-pnf 11257  df-mnf 11258  df-xr 11259  df-ltxr 11260  df-le 11261  df-sub 11453  df-neg 11454  df-nn 12220  df-2 12282  df-3 12283  df-4 12284  df-5 12285  df-6 12286  df-7 12287  df-8 12288  df-9 12289  df-n0 12480  df-z 12566  df-dec 12685  df-uz 12830  df-fz 13492  df-struct 17087  df-sets 17104  df-slot 17122  df-ndx 17134  df-base 17152  df-ress 17181  df-hom 17228  df-cco 17229  df-resc 17765  df-estrc 18084  df-rnghm 20334  df-rngc 20509
This theorem is referenced by:  rngcresringcat  20561
  Copyright terms: Public domain W3C validator