Theorem funcestrcsetc 18097

Description: The "natural forgetful functor" from the category of extensible structures into the category of sets which sends each extensible structure to its base set, preserving the morphisms as mappings between the corresponding base sets. (Contributed by AV, 23-Mar-2020.)

Hypotheses

Ref	Expression
funcestrcsetc.e	⊢ 𝐸 = (ExtStrCat‘𝑈)
funcestrcsetc.s	⊢ 𝑆 = (SetCat‘𝑈)
funcestrcsetc.b	⊢ 𝐵 = (Base‘𝐸)
funcestrcsetc.c	⊢ 𝐶 = (Base‘𝑆)
funcestrcsetc.u	⊢ (𝜑 → 𝑈 ∈ WUni)
funcestrcsetc.f	⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐵 ↦ (Base‘𝑥)))
funcestrcsetc.g	⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥)))))

Assertion

Ref	Expression
funcestrcsetc	⊢ (𝜑 → 𝐹(𝐸 Func 𝑆)𝐺)

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

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

Proof of Theorem funcestrcsetc

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

Step	Hyp	Ref	Expression
1		funcestrcsetc.b	. 2 ⊢ 𝐵 = (Base‘𝐸)
2		funcestrcsetc.c	. 2 ⊢ 𝐶 = (Base‘𝑆)
3		eqid 2732	. 2 ⊢ (Hom ‘𝐸) = (Hom ‘𝐸)
4		eqid 2732	. 2 ⊢ (Hom ‘𝑆) = (Hom ‘𝑆)
5		eqid 2732	. 2 ⊢ (Id‘𝐸) = (Id‘𝐸)
6		eqid 2732	. 2 ⊢ (Id‘𝑆) = (Id‘𝑆)
7		eqid 2732	. 2 ⊢ (comp‘𝐸) = (comp‘𝐸)
8		eqid 2732	. 2 ⊢ (comp‘𝑆) = (comp‘𝑆)
9		funcestrcsetc.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ WUni)
10		funcestrcsetc.e	. . . 4 ⊢ 𝐸 = (ExtStrCat‘𝑈)
11	10	estrccat 18080	. . 3 ⊢ (𝑈 ∈ WUni → 𝐸 ∈ Cat)
12	9, 11	syl 17	. 2 ⊢ (𝜑 → 𝐸 ∈ Cat)
13		funcestrcsetc.s	. . . 4 ⊢ 𝑆 = (SetCat‘𝑈)
14	13	setccat 18031	. . 3 ⊢ (𝑈 ∈ WUni → 𝑆 ∈ Cat)
15	9, 14	syl 17	. 2 ⊢ (𝜑 → 𝑆 ∈ Cat)
16		funcestrcsetc.f	. . 3 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐵 ↦ (Base‘𝑥)))
17	10, 13, 1, 2, 9, 16	funcestrcsetclem3 18090	. 2 ⊢ (𝜑 → 𝐹:𝐵⟶𝐶)
18		funcestrcsetc.g	. . 3 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥)))))
19	10, 13, 1, 2, 9, 16, 18	funcestrcsetclem4 18091	. 2 ⊢ (𝜑 → 𝐺 Fn (𝐵 × 𝐵))
20	10, 13, 1, 2, 9, 16, 18	funcestrcsetclem8 18095	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎𝐺𝑏):(𝑎(Hom ‘𝐸)𝑏)⟶((𝐹‘𝑎)(Hom ‘𝑆)(𝐹‘𝑏)))
21	10, 13, 1, 2, 9, 16, 18	funcestrcsetclem7 18094	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((𝑎𝐺𝑎)‘((Id‘𝐸)‘𝑎)) = ((Id‘𝑆)‘(𝐹‘𝑎)))
22	10, 13, 1, 2, 9, 16, 18	funcestrcsetclem9 18096	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) ∧ (ℎ ∈ (𝑎(Hom ‘𝐸)𝑏) ∧ 𝑘 ∈ (𝑏(Hom ‘𝐸)𝑐))) → ((𝑎𝐺𝑐)‘(𝑘(⟨𝑎, 𝑏⟩(comp‘𝐸)𝑐)ℎ)) = (((𝑏𝐺𝑐)‘𝑘)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝑆)(𝐹‘𝑐))((𝑎𝐺𝑏)‘ℎ)))
23	1, 2, 3, 4, 5, 6, 7, 8, 12, 15, 17, 19, 20, 21, 22	isfuncd 17811	1 ⊢ (𝜑 → 𝐹(𝐸 Func 𝑆)𝐺)

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2106   class class class wbr 5147   ↦ cmpt 5230   I cid 5572   ↾ cres 5677  ‘cfv 6540  (class class class)co 7405   ∈ cmpo 7407   ↑_m cmap 8816  WUnicwun 10691  Basecbs 17140  Hom chom 17204  compcco 17205  Catccat 17604  Idccid 17605   Func cfunc 17800  SetCatcsetc 18021  ExtStrCatcestrc 18069

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-tp 4632  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7852  df-1st 7971  df-2nd 7972  df-frecs 8262  df-wrecs 8293  df-recs 8367  df-rdg 8406  df-1o 8462  df-er 8699  df-map 8818  df-ixp 8888  df-en 8936  df-dom 8937  df-sdom 8938  df-fin 8939  df-wun 10693  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11442  df-neg 11443  df-nn 12209  df-2 12271  df-3 12272  df-4 12273  df-5 12274  df-6 12275  df-7 12276  df-8 12277  df-9 12278  df-n0 12469  df-z 12555  df-dec 12674  df-uz 12819  df-fz 13481  df-struct 17076  df-slot 17111  df-ndx 17123  df-base 17141  df-hom 17217  df-cco 17218  df-cat 17608  df-cid 17609  df-func 17804  df-setc 18022  df-estrc 18070

This theorem is referenced by:  fthestrcsetc  18098  fullestrcsetc  18099  funcrngcsetc  46849  funcrngcsetcALT  46850  funcringcsetc  46886