Theorem funcringcsetcALTV 49013

Description: The "natural forgetful functor" from the category of 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
funcringcsetcALTV.r	⊢ 𝑅 = (RingCatALTV‘𝑈)
funcringcsetcALTV.s	⊢ 𝑆 = (SetCat‘𝑈)
funcringcsetcALTV.b	⊢ 𝐵 = (Base‘𝑅)
funcringcsetcALTV.c	⊢ 𝐶 = (Base‘𝑆)
funcringcsetcALTV.u	⊢ (𝜑 → 𝑈 ∈ WUni)
funcringcsetcALTV.f	⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐵 ↦ (Base‘𝑥)))
funcringcsetcALTV.g	⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ (𝑥 RingHom 𝑦))))

Assertion

Ref	Expression
funcringcsetcALTV	⊢ (𝜑 → 𝐹(𝑅 Func 𝑆)𝐺)

Distinct variable groups:   𝑥,𝐵   𝜑,𝑥   𝑥,𝐶   𝑦,𝐵,𝑥   𝜑,𝑦

Allowed substitution hints:   𝐶(𝑦)   𝑅(𝑥,𝑦)   𝑆(𝑥,𝑦)   𝑈(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝐺(𝑥,𝑦)

Proof of Theorem funcringcsetcALTV

Dummy variables 𝑎 𝑏 𝑐 ℎ 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		funcringcsetcALTV.b	. 2 ⊢ 𝐵 = (Base‘𝑅)
2		funcringcsetcALTV.c	. 2 ⊢ 𝐶 = (Base‘𝑆)
3		eqid 2769	. 2 ⊢ (Hom ‘𝑅) = (Hom ‘𝑅)
4		eqid 2769	. 2 ⊢ (Hom ‘𝑆) = (Hom ‘𝑆)
5		eqid 2769	. 2 ⊢ (Id‘𝑅) = (Id‘𝑅)
6		eqid 2769	. 2 ⊢ (Id‘𝑆) = (Id‘𝑆)
7		eqid 2769	. 2 ⊢ (comp‘𝑅) = (comp‘𝑅)
8		eqid 2769	. 2 ⊢ (comp‘𝑆) = (comp‘𝑆)
9		funcringcsetcALTV.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ WUni)
10		funcringcsetcALTV.r	. . . 4 ⊢ 𝑅 = (RingCatALTV‘𝑈)
11	10	ringccatALTV 48998	. . 3 ⊢ (𝑈 ∈ WUni → 𝑅 ∈ Cat)
12	9, 11	syl 18	. 2 ⊢ (𝜑 → 𝑅 ∈ Cat)
13		funcringcsetcALTV.s	. . . 4 ⊢ 𝑆 = (SetCat‘𝑈)
14	13	setccat 18144	. . 3 ⊢ (𝑈 ∈ WUni → 𝑆 ∈ Cat)
15	9, 14	syl 18	. 2 ⊢ (𝜑 → 𝑆 ∈ Cat)
16		funcringcsetcALTV.f	. . 3 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐵 ↦ (Base‘𝑥)))
17	10, 13, 1, 2, 9, 16	funcringcsetclem3ALTV 49006	. 2 ⊢ (𝜑 → 𝐹:𝐵⟶𝐶)
18		funcringcsetcALTV.g	. . 3 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ (𝑥 RingHom 𝑦))))
19	10, 13, 1, 2, 9, 16, 18	funcringcsetclem4ALTV 49007	. 2 ⊢ (𝜑 → 𝐺 Fn (𝐵 × 𝐵))
20	10, 13, 1, 2, 9, 16, 18	funcringcsetclem8ALTV 49011	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎𝐺𝑏):(𝑎(Hom ‘𝑅)𝑏)⟶((𝐹‘𝑎)(Hom ‘𝑆)(𝐹‘𝑏)))
21	10, 13, 1, 2, 9, 16, 18	funcringcsetclem7ALTV 49010	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((𝑎𝐺𝑎)‘((Id‘𝑅)‘𝑎)) = ((Id‘𝑆)‘(𝐹‘𝑎)))
22	10, 13, 1, 2, 9, 16, 18	funcringcsetclem9ALTV 49012	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) ∧ (ℎ ∈ (𝑎(Hom ‘𝑅)𝑏) ∧ 𝑘 ∈ (𝑏(Hom ‘𝑅)𝑐))) → ((𝑎𝐺𝑐)‘(𝑘(⟨𝑎, 𝑏⟩(comp‘𝑅)𝑐)ℎ)) = (((𝑏𝐺𝑐)‘𝑘)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝑆)(𝐹‘𝑐))((𝑎𝐺𝑏)‘ℎ)))
23	1, 2, 3, 4, 5, 6, 7, 8, 12, 15, 17, 19, 20, 21, 22	isfuncd 17924	1 ⊢ (𝜑 → 𝐹(𝑅 Func 𝑆)𝐺)

Syntax hints:   → wi 4   = wceq 1567   ∈ wcel 2149   class class class wbr 5113   ↦ cmpt 5196   I cid 5558   ↾ cres 5666  ‘cfv 6539  (class class class)co 7413   ∈ cmpo 7415  WUnicwun 10687  Basecbs 17271  Hom chom 17323  compcco 17324  Catccat 17722  Idccid 17723   Func cfunc 17913  SetCatcsetc 18134   RingHom crh 20553  RingCatALTVcringcALTV 48978

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 5242  ax-sep 5261  ax-nul 5273  ax-pow 5339  ax-pr 5407  ax-un 7735  ax-cnex 11158  ax-resscn 11159  ax-1cn 11160  ax-icn 11161  ax-addcl 11162  ax-addrcl 11163  ax-mulcl 11164  ax-mulrcl 11165  ax-mulcom 11166  ax-addass 11167  ax-mulass 11168  ax-distr 11169  ax-i2m1 11170  ax-1ne0 11171  ax-1rid 11172  ax-rnegex 11173  ax-rrecex 11174  ax-cnre 11175  ax-pre-lttri 11176  ax-pre-lttrn 11177  ax-pre-ltadd 11178  ax-pre-mulgt0 11179

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-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5559  df-eprel 5564  df-po 5572  df-so 5573  df-fr 5617  df-we 5619  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-rn 5675  df-res 5676  df-ima 5677  df-pred 6305  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6495  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7865  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-er 8696  df-map 8828  df-ixp 8898  df-en 8946  df-dom 8947  df-sdom 8948  df-fin 8949  df-wun 10689  df-pnf 11247  df-mnf 11248  df-xr 11249  df-ltxr 11250  df-le 11251  df-sub 11445  df-neg 11446  df-nn 12236  df-2 12305  df-3 12306  df-4 12307  df-5 12308  df-6 12309  df-7 12310  df-8 12311  df-9 12312  df-n0 12507  df-z 12594  df-dec 12714  df-uz 12865  df-fz 13538  df-struct 17209  df-sets 17226  df-slot 17244  df-ndx 17256  df-base 17272  df-plusg 17325  df-hom 17336  df-cco 17337  df-0g 17496  df-cat 17726  df-cid 17727  df-func 17917  df-setc 18135  df-mgm 18700  df-sgrp 18779  df-mnd 18795  df-mhm 18843  df-grp 19005  df-ghm 19286  df-mgp 20219  df-ur 20266  df-ring 20319  df-rhm 20556  df-ringcALTV 48979

This theorem is referenced by: (None)