Theorem funcringcsetcALTV2 48277

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.

Step	Hyp	Ref	Expression
1		funcringcsetcALTV2.b	. 2 ⊢ 𝐵 = (Base‘𝑅)
2		funcringcsetcALTV2.c	. 2 ⊢ 𝐶 = (Base‘𝑆)
3		eqid 2730	. 2 ⊢ (Hom ‘𝑅) = (Hom ‘𝑅)
4		eqid 2730	. 2 ⊢ (Hom ‘𝑆) = (Hom ‘𝑆)
5		eqid 2730	. 2 ⊢ (Id‘𝑅) = (Id‘𝑅)
6		eqid 2730	. 2 ⊢ (Id‘𝑆) = (Id‘𝑆)
7		eqid 2730	. 2 ⊢ (comp‘𝑅) = (comp‘𝑅)
8		eqid 2730	. 2 ⊢ (comp‘𝑆) = (comp‘𝑆)
9		funcringcsetcALTV2.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ WUni)
10		funcringcsetcALTV2.r	. . . 4 ⊢ 𝑅 = (RingCat‘𝑈)
11	10	ringccat 20578	. . 3 ⊢ (𝑈 ∈ WUni → 𝑅 ∈ Cat)
12	9, 11	syl 17	. 2 ⊢ (𝜑 → 𝑅 ∈ Cat)
13		funcringcsetcALTV2.s	. . . 4 ⊢ 𝑆 = (SetCat‘𝑈)
14	13	setccat 18053	. . 3 ⊢ (𝑈 ∈ WUni → 𝑆 ∈ Cat)
15	9, 14	syl 17	. 2 ⊢ (𝜑 → 𝑆 ∈ Cat)
16		funcringcsetcALTV2.f	. . 3 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐵 ↦ (Base‘𝑥)))
17	10, 13, 1, 2, 9, 16	funcringcsetcALTV2lem3 48270	. 2 ⊢ (𝜑 → 𝐹:𝐵⟶𝐶)
18		funcringcsetcALTV2.g	. . 3 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ (𝑥 RingHom 𝑦))))
19	10, 13, 1, 2, 9, 16, 18	funcringcsetcALTV2lem4 48271	. 2 ⊢ (𝜑 → 𝐺 Fn (𝐵 × 𝐵))
20	10, 13, 1, 2, 9, 16, 18	funcringcsetcALTV2lem8 48275	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎𝐺𝑏):(𝑎(Hom ‘𝑅)𝑏)⟶((𝐹‘𝑎)(Hom ‘𝑆)(𝐹‘𝑏)))
21	10, 13, 1, 2, 9, 16, 18	funcringcsetcALTV2lem7 48274	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((𝑎𝐺𝑎)‘((Id‘𝑅)‘𝑎)) = ((Id‘𝑆)‘(𝐹‘𝑎)))
22	10, 13, 1, 2, 9, 16, 18	funcringcsetcALTV2lem9 48276	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) ∧ (ℎ ∈ (𝑎(Hom ‘𝑅)𝑏) ∧ 𝑘 ∈ (𝑏(Hom ‘𝑅)𝑐))) → ((𝑎𝐺𝑐)‘(𝑘(⟨𝑎, 𝑏⟩(comp‘𝑅)𝑐)ℎ)) = (((𝑏𝐺𝑐)‘𝑘)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝑆)(𝐹‘𝑐))((𝑎𝐺𝑏)‘ℎ)))
23	1, 2, 3, 4, 5, 6, 7, 8, 12, 15, 17, 19, 20, 21, 22	isfuncd 17833	1 ⊢ (𝜑 → 𝐹(𝑅 Func 𝑆)𝐺)

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2109   class class class wbr 5109   ↦ cmpt 5190   I cid 5534   ↾ cres 5642  ‘cfv 6513  (class class class)co 7389   ∈ cmpo 7391  WUnicwun 10659  Basecbs 17185  Hom chom 17237  compcco 17238  Catccat 17631  Idccid 17632   Func cfunc 17822  SetCatcsetc 18043   RingHom crh 20384  RingCatcringc 20560

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5236  ax-sep 5253  ax-nul 5263  ax-pow 5322  ax-pr 5389  ax-un 7713  ax-cnex 11130  ax-resscn 11131  ax-1cn 11132  ax-icn 11133  ax-addcl 11134  ax-addrcl 11135  ax-mulcl 11136  ax-mulrcl 11137  ax-mulcom 11138  ax-addass 11139  ax-mulass 11140  ax-distr 11141  ax-i2m1 11142  ax-1ne0 11143  ax-1rid 11144  ax-rnegex 11145  ax-rrecex 11146  ax-cnre 11147  ax-pre-lttri 11148  ax-pre-lttrn 11149  ax-pre-ltadd 11150  ax-pre-mulgt0 11151

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-pss 3936  df-nul 4299  df-if 4491  df-pw 4567  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4874  df-iun 4959  df-br 5110  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-pred 6276  df-ord 6337  df-on 6338  df-lim 6339  df-suc 6340  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-f1 6518  df-fo 6519  df-f1o 6520  df-fv 6521  df-riota 7346  df-ov 7392  df-oprab 7393  df-mpo 7394  df-om 7845  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8380  df-1o 8436  df-er 8673  df-map 8803  df-pm 8804  df-ixp 8873  df-en 8921  df-dom 8922  df-sdom 8923  df-fin 8924  df-wun 10661  df-pnf 11216  df-mnf 11217  df-xr 11218  df-ltxr 11219  df-le 11220  df-sub 11413  df-neg 11414  df-nn 12188  df-2 12250  df-3 12251  df-4 12252  df-5 12253  df-6 12254  df-7 12255  df-8 12256  df-9 12257  df-n0 12449  df-z 12536  df-dec 12656  df-uz 12800  df-fz 13475  df-struct 17123  df-sets 17140  df-slot 17158  df-ndx 17170  df-base 17186  df-ress 17207  df-plusg 17239  df-hom 17250  df-cco 17251  df-0g 17410  df-cat 17635  df-cid 17636  df-homf 17637  df-ssc 17778  df-resc 17779  df-subc 17780  df-func 17826  df-setc 18044  df-estrc 18090  df-mgm 18573  df-sgrp 18652  df-mnd 18668  df-mhm 18716  df-grp 18874  df-ghm 19151  df-mgp 20056  df-ur 20097  df-ring 20150  df-rhm 20387  df-ringc 20561

This theorem is referenced by: (None)