Theorem funcringcsetcALTV2 49340

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 2761	. 2 ⊢ (Hom ‘𝑅) = (Hom ‘𝑅)
4		eqid 2761	. 2 ⊢ (Hom ‘𝑆) = (Hom ‘𝑆)
5		eqid 2761	. 2 ⊢ (Id‘𝑅) = (Id‘𝑅)
6		eqid 2761	. 2 ⊢ (Id‘𝑆) = (Id‘𝑆)
7		eqid 2761	. 2 ⊢ (comp‘𝑅) = (comp‘𝑅)
8		eqid 2761	. 2 ⊢ (comp‘𝑆) = (comp‘𝑆)
9		funcringcsetcALTV2.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ WUni)
10		funcringcsetcALTV2.r	. . . 4 ⊢ 𝑅 = (RingCat‘𝑈)
11	10	ringccat 20895	. . 3 ⊢ (𝑈 ∈ WUni → 𝑅 ∈ Cat)
12	9, 11	syl 18	. 2 ⊢ (𝜑 → 𝑅 ∈ Cat)
13		funcringcsetcALTV2.s	. . . 4 ⊢ 𝑆 = (SetCat‘𝑈)
14	13	setccat 18240	. . 3 ⊢ (𝑈 ∈ WUni → 𝑆 ∈ Cat)
15	9, 14	syl 18	. 2 ⊢ (𝜑 → 𝑆 ∈ Cat)
16		funcringcsetcALTV2.f	. . 3 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐵 ↦ (Base‘𝑥)))
17	10, 13, 1, 2, 9, 16	funcringcsetcALTV2lem3 49333	. 2 ⊢ (𝜑 → 𝐹:𝐵⟶𝐶)
18		funcringcsetcALTV2.g	. . 3 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ (𝑥 RingHom 𝑦))))
19	10, 13, 1, 2, 9, 16, 18	funcringcsetcALTV2lem4 49334	. 2 ⊢ (𝜑 → 𝐺 Fn (𝐵 × 𝐵))
20	10, 13, 1, 2, 9, 16, 18	funcringcsetcALTV2lem8 49338	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎𝐺𝑏):(𝑎(Hom ‘𝑅)𝑏)⟶((𝐹‘𝑎)(Hom ‘𝑆)(𝐹‘𝑏)))
21	10, 13, 1, 2, 9, 16, 18	funcringcsetcALTV2lem7 49337	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((𝑎𝐺𝑎)‘((Id‘𝑅)‘𝑎)) = ((Id‘𝑆)‘(𝐹‘𝑎)))
22	10, 13, 1, 2, 9, 16, 18	funcringcsetcALTV2lem9 49339	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) ∧ (ℎ ∈ (𝑎(Hom ‘𝑅)𝑏) ∧ 𝑘 ∈ (𝑏(Hom ‘𝑅)𝑐))) → ((𝑎𝐺𝑐)‘(𝑘(⟨𝑎, 𝑏⟩(comp‘𝑅)𝑐)ℎ)) = (((𝑏𝐺𝑐)‘𝑘)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝑆)(𝐹‘𝑐))((𝑎𝐺𝑏)‘ℎ)))
23	1, 2, 3, 4, 5, 6, 7, 8, 12, 15, 17, 19, 20, 21, 22	isfuncd 18020	1 ⊢ (𝜑 → 𝐹(𝑅 Func 𝑆)𝐺)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145   class class class wbr 5103   ↦ cmpt 5186   I cid 5545   ↾ cres 5653  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  WUnicwun 10766  Basecbs 17367  Hom chom 17419  compcco 17420  Catccat 17818  Idccid 17819   Func cfunc 18009  SetCatcsetc 18230   RingHom crh 20679  RingCatcringc 20877

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-resscn 11238  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-addrcl 11242  ax-mulcl 11243  ax-mulrcl 11244  ax-mulcom 11245  ax-addass 11246  ax-mulass 11247  ax-distr 11248  ax-i2m1 11249  ax-1ne0 11250  ax-1rid 11251  ax-rnegex 11252  ax-rrecex 11253  ax-cnre 11254  ax-pre-lttri 11255  ax-pre-lttrn 11256  ax-pre-ltadd 11257  ax-pre-mulgt0 11258

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-er 8701  df-map 8833  df-pm 8834  df-ixp 8910  df-en 8958  df-dom 8959  df-sdom 8960  df-fin 8961  df-wun 10768  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11524  df-neg 11525  df-nn 12317  df-2 12386  df-3 12387  df-4 12388  df-5 12389  df-6 12390  df-7 12391  df-8 12392  df-9 12393  df-n0 12588  df-z 12675  df-dec 12796  df-uz 12947  df-fz 13621  df-struct 17305  df-sets 17322  df-slot 17340  df-ndx 17352  df-base 17368  df-ress 17389  df-plusg 17421  df-hom 17432  df-cco 17433  df-0g 17592  df-cat 17822  df-cid 17823  df-homf 17824  df-ssc 17965  df-resc 17966  df-subc 17967  df-func 18013  df-setc 18231  df-estrc 18277  df-mgm 18796  df-sgrp 18888  df-mnd 18904  df-mhm 18958  df-grp 19127  df-ghm 19408  df-mgp 20341  df-ur 20388  df-ring 20441  df-rhm 20682  df-ringc 20878

This theorem is used by: (None)