Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  funcringcsetcALTV2 Structured version   Visualization version   GIF version

Theorem funcringcsetcALTV2 48787
Description: The "natural forgetful functor" from the category of unital rings into the category of sets which sends each ring to its underlying set (base set) and the morphisms (ring homomorphisms) to mappings of the corresponding base sets. (Contributed by AV, 16-Feb-2020.) (New usage is discouraged.)
Hypotheses
Ref Expression
funcringcsetcALTV2.r 𝑅 = (RingCat‘𝑈)
funcringcsetcALTV2.s 𝑆 = (SetCat‘𝑈)
funcringcsetcALTV2.b 𝐵 = (Base‘𝑅)
funcringcsetcALTV2.c 𝐶 = (Base‘𝑆)
funcringcsetcALTV2.u (𝜑𝑈 ∈ WUni)
funcringcsetcALTV2.f (𝜑𝐹 = (𝑥𝐵 ↦ (Base‘𝑥)))
funcringcsetcALTV2.g (𝜑𝐺 = (𝑥𝐵, 𝑦𝐵 ↦ ( I ↾ (𝑥 RingHom 𝑦))))
Assertion
Ref Expression
funcringcsetcALTV2 (𝜑𝐹(𝑅 Func 𝑆)𝐺)
Distinct variable groups:   𝑥,𝐵   𝜑,𝑥   𝑥,𝐶   𝑦,𝐵,𝑥   𝜑,𝑦
Allowed substitution hints:   𝐶(𝑦)   𝑅(𝑥,𝑦)   𝑆(𝑥,𝑦)   𝑈(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝐺(𝑥,𝑦)

Proof of Theorem funcringcsetcALTV2
Dummy variables 𝑎 𝑏 𝑐 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 funcringcsetcALTV2.b . 2 𝐵 = (Base‘𝑅)
2 funcringcsetcALTV2.c . 2 𝐶 = (Base‘𝑆)
3 eqid 2737 . 2 (Hom ‘𝑅) = (Hom ‘𝑅)
4 eqid 2737 . 2 (Hom ‘𝑆) = (Hom ‘𝑆)
5 eqid 2737 . 2 (Id‘𝑅) = (Id‘𝑅)
6 eqid 2737 . 2 (Id‘𝑆) = (Id‘𝑆)
7 eqid 2737 . 2 (comp‘𝑅) = (comp‘𝑅)
8 eqid 2737 . 2 (comp‘𝑆) = (comp‘𝑆)
9 funcringcsetcALTV2.u . . 3 (𝜑𝑈 ∈ WUni)
10 funcringcsetcALTV2.r . . . 4 𝑅 = (RingCat‘𝑈)
1110ringccat 20631 . . 3 (𝑈 ∈ WUni → 𝑅 ∈ Cat)
129, 11syl 17 . 2 (𝜑𝑅 ∈ Cat)
13 funcringcsetcALTV2.s . . . 4 𝑆 = (SetCat‘𝑈)
1413setccat 18043 . . 3 (𝑈 ∈ WUni → 𝑆 ∈ Cat)
159, 14syl 17 . 2 (𝜑𝑆 ∈ Cat)
16 funcringcsetcALTV2.f . . 3 (𝜑𝐹 = (𝑥𝐵 ↦ (Base‘𝑥)))
1710, 13, 1, 2, 9, 16funcringcsetcALTV2lem3 48780 . 2 (𝜑𝐹:𝐵𝐶)
18 funcringcsetcALTV2.g . . 3 (𝜑𝐺 = (𝑥𝐵, 𝑦𝐵 ↦ ( I ↾ (𝑥 RingHom 𝑦))))
1910, 13, 1, 2, 9, 16, 18funcringcsetcALTV2lem4 48781 . 2 (𝜑𝐺 Fn (𝐵 × 𝐵))
2010, 13, 1, 2, 9, 16, 18funcringcsetcALTV2lem8 48785 . 2 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝑎𝐺𝑏):(𝑎(Hom ‘𝑅)𝑏)⟶((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)))
2110, 13, 1, 2, 9, 16, 18funcringcsetcALTV2lem7 48784 . 2 ((𝜑𝑎𝐵) → ((𝑎𝐺𝑎)‘((Id‘𝑅)‘𝑎)) = ((Id‘𝑆)‘(𝐹𝑎)))
2210, 13, 1, 2, 9, 16, 18funcringcsetcALTV2lem9 48786 . 2 ((𝜑 ∧ (𝑎𝐵𝑏𝐵𝑐𝐵) ∧ ( ∈ (𝑎(Hom ‘𝑅)𝑏) ∧ 𝑘 ∈ (𝑏(Hom ‘𝑅)𝑐))) → ((𝑎𝐺𝑐)‘(𝑘(⟨𝑎, 𝑏⟩(comp‘𝑅)𝑐))) = (((𝑏𝐺𝑐)‘𝑘)(⟨(𝐹𝑎), (𝐹𝑏)⟩(comp‘𝑆)(𝐹𝑐))((𝑎𝐺𝑏)‘)))
231, 2, 3, 4, 5, 6, 7, 8, 12, 15, 17, 19, 20, 21, 22isfuncd 17823 1 (𝜑𝐹(𝑅 Func 𝑆)𝐺)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114   class class class wbr 5086  cmpt 5167   I cid 5518  cres 5626  cfv 6492  (class class class)co 7360  cmpo 7362  WUnicwun 10614  Basecbs 17170  Hom chom 17222  compcco 17223  Catccat 17621  Idccid 17622   Func cfunc 17812  SetCatcsetc 18033   RingHom crh 20440  RingCatcringc 20613
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-er 8636  df-map 8768  df-pm 8769  df-ixp 8839  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-wun 10616  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-3 12236  df-4 12237  df-5 12238  df-6 12239  df-7 12240  df-8 12241  df-9 12242  df-n0 12429  df-z 12516  df-dec 12636  df-uz 12780  df-fz 13453  df-struct 17108  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-ress 17192  df-plusg 17224  df-hom 17235  df-cco 17236  df-0g 17395  df-cat 17625  df-cid 17626  df-homf 17627  df-ssc 17768  df-resc 17769  df-subc 17770  df-func 17816  df-setc 18034  df-estrc 18080  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-mhm 18742  df-grp 18903  df-ghm 19179  df-mgp 20113  df-ur 20154  df-ring 20207  df-rhm 20443  df-ringc 20614
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator