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 41837
 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 2610 . 2 (Hom ‘𝑅) = (Hom ‘𝑅)
4 eqid 2610 . 2 (Hom ‘𝑆) = (Hom ‘𝑆)
5 eqid 2610 . 2 (Id‘𝑅) = (Id‘𝑅)
6 eqid 2610 . 2 (Id‘𝑆) = (Id‘𝑆)
7 eqid 2610 . 2 (comp‘𝑅) = (comp‘𝑅)
8 eqid 2610 . 2 (comp‘𝑆) = (comp‘𝑆)
9 funcringcsetcALTV2.u . . 3 (𝜑𝑈 ∈ WUni)
10 funcringcsetcALTV2.r . . . 4 𝑅 = (RingCat‘𝑈)
1110ringccat 41816 . . 3 (𝑈 ∈ WUni → 𝑅 ∈ Cat)
129, 11syl 17 . 2 (𝜑𝑅 ∈ Cat)
13 funcringcsetcALTV2.s . . . 4 𝑆 = (SetCat‘𝑈)
1413setccat 16558 . . 3 (𝑈 ∈ WUni → 𝑆 ∈ Cat)
159, 14syl 17 . 2 (𝜑𝑆 ∈ Cat)
16 funcringcsetcALTV2.f . . 3 (𝜑𝐹 = (𝑥𝐵 ↦ (Base‘𝑥)))
1710, 13, 1, 2, 9, 16funcringcsetcALTV2lem3 41830 . 2 (𝜑𝐹:𝐵𝐶)
18 funcringcsetcALTV2.g . . 3 (𝜑𝐺 = (𝑥𝐵, 𝑦𝐵 ↦ ( I ↾ (𝑥 RingHom 𝑦))))
1910, 13, 1, 2, 9, 16, 18funcringcsetcALTV2lem4 41831 . 2 (𝜑𝐺 Fn (𝐵 × 𝐵))
2010, 13, 1, 2, 9, 16, 18funcringcsetcALTV2lem8 41835 . 2 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝑎𝐺𝑏):(𝑎(Hom ‘𝑅)𝑏)⟶((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)))
2110, 13, 1, 2, 9, 16, 18funcringcsetcALTV2lem7 41834 . 2 ((𝜑𝑎𝐵) → ((𝑎𝐺𝑎)‘((Id‘𝑅)‘𝑎)) = ((Id‘𝑆)‘(𝐹𝑎)))
2210, 13, 1, 2, 9, 16, 18funcringcsetcALTV2lem9 41836 . 2 ((𝜑 ∧ (𝑎𝐵𝑏𝐵𝑐𝐵) ∧ ( ∈ (𝑎(Hom ‘𝑅)𝑏) ∧ 𝑘 ∈ (𝑏(Hom ‘𝑅)𝑐))) → ((𝑎𝐺𝑐)‘(𝑘(⟨𝑎, 𝑏⟩(comp‘𝑅)𝑐))) = (((𝑏𝐺𝑐)‘𝑘)(⟨(𝐹𝑎), (𝐹𝑏)⟩(comp‘𝑆)(𝐹𝑐))((𝑎𝐺𝑏)‘)))
231, 2, 3, 4, 5, 6, 7, 8, 12, 15, 17, 19, 20, 21, 22isfuncd 16348 1 (𝜑𝐹(𝑅 Func 𝑆)𝐺)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1475   ∈ wcel 1977   class class class wbr 4583   ↦ cmpt 4643   I cid 4948   ↾ cres 5040  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  WUnicwun 9401  Basecbs 15695  Hom chom 15779  compcco 15780  Catccat 16148  Idccid 16149   Func cfunc 16337  SetCatcsetc 16548   RingHom crh 18535  RingCatcringc 41795 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-ixp 7795  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-wun 9403  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-3 10957  df-4 10958  df-5 10959  df-6 10960  df-7 10961  df-8 10962  df-9 10963  df-n0 11170  df-z 11255  df-dec 11370  df-uz 11564  df-fz 12198  df-struct 15697  df-ndx 15698  df-slot 15699  df-base 15700  df-sets 15701  df-ress 15702  df-plusg 15781  df-hom 15793  df-cco 15794  df-0g 15925  df-cat 16152  df-cid 16153  df-homf 16154  df-ssc 16293  df-resc 16294  df-subc 16295  df-func 16341  df-setc 16549  df-estrc 16586  df-mgm 17065  df-sgrp 17107  df-mnd 17118  df-mhm 17158  df-grp 17248  df-ghm 17481  df-mgp 18313  df-ur 18325  df-ring 18372  df-rnghom 18538  df-ringc 41797 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator