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

Theorem dfrngc2 20933
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 20923 . 2 (𝜑 → 𝐶 = ((ExtStrCat‘𝑈) ↾cat 𝐻))
6 eqid 2766 . . 3 ((ExtStrCat‘𝑈) ↾cat 𝐻) = ((ExtStrCat‘𝑈) ↾cat 𝐻)
7 fvexd 6930 . . 3 (𝜑 → (ExtStrCat‘𝑈) ∈ V)
8 inex1g 5285 . . . . 5 (𝑈 ∈ 𝑉 → (𝑈 ∩ Rng) ∈ V)
92, 8syl 18 . . . 4 (𝜑 → (𝑈 ∩ Rng) ∈ V)
103, 9eqeltrd 2867 . . 3 (𝜑 → 𝐵 ∈ V)
113, 4rnghmresfn 20924 . . 3 (𝜑 → 𝐻 Fn (𝐵 × 𝐵))
126, 7, 10, 11rescval2 18055 . 2 (𝜑 → ((ExtStrCat‘𝑈) ↾cat 𝐻) = (((ExtStrCat‘𝑈) ↾s 𝐵) sSet ⟨(Hom ‘ndx), 𝐻⟩))
13 eqid 2766 . . . 4 (ExtStrCat‘𝑈) = (ExtStrCat‘𝑈)
14 eqidd 2767 . . . 4 (𝜑 → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
15 dfrngc2.o . . . . 5 (𝜑 → · = (comp‘(ExtStrCat‘𝑈)))
16 eqid 2766 . . . . . 6 (comp‘(ExtStrCat‘𝑈)) = (comp‘(ExtStrCat‘𝑈))
1713, 2, 16estrccofval 18355 . . . . 5 (𝜑 → (comp‘(ExtStrCat‘𝑈)) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd ‘𝑣))), 𝑓 ∈ ((Base‘(2nd ‘𝑣)) ↑m (Base‘(1st ‘𝑣))) ↦ (𝑔 ∘ 𝑓))))
1815, 17eqtrd 2801 . . . 4 (𝜑 → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd ‘𝑣))), 𝑓 ∈ ((Base‘(2nd ‘𝑣)) ↑m (Base‘(1st ‘𝑣))) ↦ (𝑔 ∘ 𝑓))))
1913, 2, 14, 18estrcval 18350 . . 3 (𝜑 → (ExtStrCat‘𝑈) = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))⟩, ⟨(comp‘ndx), · ⟩})
20 mpoexga 8124 . . . 4 ((𝑈 ∈ 𝑉 ∧ 𝑈 ∈ 𝑉) → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ∈ V)
212, 2, 20syl2anc 596 . . 3 (𝜑 → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ∈ V)
22 fvexd 6930 . . . 4 (𝜑 → (comp‘(ExtStrCat‘𝑈)) ∈ V)
2315, 22eqeltrd 2867 . . 3 (𝜑 → · ∈ V)
24 rnghmfn 20722 . . . . . 6 RngHom Fn (Rng × Rng)
25 fnfun 6668 . . . . . 6 ( RngHom Fn (Rng × Rng) → Fun RngHom )
2624, 25mp1i 14 . . . . 5 (𝜑 → Fun RngHom )
27 sqxpexg 7800 . . . . . 6 (𝐵 ∈ V → (𝐵 × 𝐵) ∈ V)
2810, 27syl 18 . . . . 5 (𝜑 → (𝐵 × 𝐵) ∈ V)
29 resfunexg 7251 . . . . 5 ((Fun RngHom ∧ (𝐵 × 𝐵) ∈ V) → ( RngHom ↾ (𝐵 × 𝐵)) ∈ V)
3026, 28, 29syl2anc 596 . . . 4 (𝜑 → ( RngHom ↾ (𝐵 × 𝐵)) ∈ V)
314, 30eqeltrd 2867 . . 3 (𝜑 → 𝐻 ∈ V)
32 inss1 4135 . . . 4 (𝑈 ∩ Rng) ⊆ 𝑈
333, 32eqsstrdi 3956 . . 3 (𝜑 → 𝐵 ⊆ 𝑈)
3419, 2, 21, 23, 31, 33estrres 18365 . 2 (𝜑 → (((ExtStrCat‘𝑈) ↾s 𝐵) sSet ⟨(Hom ‘ndx), 𝐻⟩) = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
355, 12, 343eqtrd 2805 1 (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1572   ∈ wcel 2150  Vcvv 3453   ∩ cin 4091  {ctp 4591  ⟨cop 4839   × cxp 5655   ↾ cres 5659   ∘ ccom 5661  Fun wfun 6559   Fn wfn 6560  ‘cfv 6565  (class class class)co 7450   ∈ cmpo 7452  1st c1st 8032  2nd c2nd 8033   ↑m cmap 8884   sSet csts 17387  ndxcnx 17417  Basecbs 17433   ↾s cress 17454  Hom chom 17485  compcco 17486   ↾cat cresc 18035  ExtStrCatcestrc 18348  Rngcrng 20427   RngHom crnghm 20717  RngCatcrngc 20921
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-3 12445  df-4 12446  df-5 12447  df-6 12448  df-7 12449  df-8 12450  df-9 12451  df-n0 12646  df-z 12733  df-dec 12854  df-uz 13005  df-fz 13679  df-struct 17371  df-sets 17388  df-slot 17406  df-ndx 17418  df-base 17434  df-ress 17455  df-hom 17499  df-cco 17500  df-resc 18038  df-estrc 18349  df-rnghm 20719  df-rngc 20922
This theorem is used by:  rngcresringcat  20974
  Copyright terms: Public domain W3C validator