Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  funcestrcsetc Structured version   Visualization version   GIF version

Theorem funcestrcsetc 17391
 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.
StepHypRef Expression
1 funcestrcsetc.b . 2 𝐵 = (Base‘𝐸)
2 funcestrcsetc.c . 2 𝐶 = (Base‘𝑆)
3 eqid 2798 . 2 (Hom ‘𝐸) = (Hom ‘𝐸)
4 eqid 2798 . 2 (Hom ‘𝑆) = (Hom ‘𝑆)
5 eqid 2798 . 2 (Id‘𝐸) = (Id‘𝐸)
6 eqid 2798 . 2 (Id‘𝑆) = (Id‘𝑆)
7 eqid 2798 . 2 (comp‘𝐸) = (comp‘𝐸)
8 eqid 2798 . 2 (comp‘𝑆) = (comp‘𝑆)
9 funcestrcsetc.u . . 3 (𝜑𝑈 ∈ WUni)
10 funcestrcsetc.e . . . 4 𝐸 = (ExtStrCat‘𝑈)
1110estrccat 17375 . . 3 (𝑈 ∈ WUni → 𝐸 ∈ Cat)
129, 11syl 17 . 2 (𝜑𝐸 ∈ Cat)
13 funcestrcsetc.s . . . 4 𝑆 = (SetCat‘𝑈)
1413setccat 17337 . . 3 (𝑈 ∈ WUni → 𝑆 ∈ Cat)
159, 14syl 17 . 2 (𝜑𝑆 ∈ Cat)
16 funcestrcsetc.f . . 3 (𝜑𝐹 = (𝑥𝐵 ↦ (Base‘𝑥)))
1710, 13, 1, 2, 9, 16funcestrcsetclem3 17384 . 2 (𝜑𝐹:𝐵𝐶)
18 funcestrcsetc.g . . 3 (𝜑𝐺 = (𝑥𝐵, 𝑦𝐵 ↦ ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥)))))
1910, 13, 1, 2, 9, 16, 18funcestrcsetclem4 17385 . 2 (𝜑𝐺 Fn (𝐵 × 𝐵))
2010, 13, 1, 2, 9, 16, 18funcestrcsetclem8 17389 . 2 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝑎𝐺𝑏):(𝑎(Hom ‘𝐸)𝑏)⟶((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)))
2110, 13, 1, 2, 9, 16, 18funcestrcsetclem7 17388 . 2 ((𝜑𝑎𝐵) → ((𝑎𝐺𝑎)‘((Id‘𝐸)‘𝑎)) = ((Id‘𝑆)‘(𝐹𝑎)))
2210, 13, 1, 2, 9, 16, 18funcestrcsetclem9 17390 . 2 ((𝜑 ∧ (𝑎𝐵𝑏𝐵𝑐𝐵) ∧ ( ∈ (𝑎(Hom ‘𝐸)𝑏) ∧ 𝑘 ∈ (𝑏(Hom ‘𝐸)𝑐))) → ((𝑎𝐺𝑐)‘(𝑘(⟨𝑎, 𝑏⟩(comp‘𝐸)𝑐))) = (((𝑏𝐺𝑐)‘𝑘)(⟨(𝐹𝑎), (𝐹𝑏)⟩(comp‘𝑆)(𝐹𝑐))((𝑎𝐺𝑏)‘)))
231, 2, 3, 4, 5, 6, 7, 8, 12, 15, 17, 19, 20, 21, 22isfuncd 17127 1 (𝜑𝐹(𝐸 Func 𝑆)𝐺)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1538   ∈ wcel 2111   class class class wbr 5030   ↦ cmpt 5110   I cid 5424   ↾ cres 5521  ‘cfv 6324  (class class class)co 7135   ∈ cmpo 7137   ↑m cmap 8389  WUnicwun 10111  Basecbs 16475  Hom chom 16568  compcco 16569  Catccat 16927  Idccid 16928   Func cfunc 17116  SetCatcsetc 17327  ExtStrCatcestrc 17364 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-map 8391  df-ixp 8445  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-wun 10113  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-3 11689  df-4 11690  df-5 11691  df-6 11692  df-7 11693  df-8 11694  df-9 11695  df-n0 11886  df-z 11970  df-dec 12087  df-uz 12232  df-fz 12886  df-struct 16477  df-ndx 16478  df-slot 16479  df-base 16481  df-hom 16581  df-cco 16582  df-cat 16931  df-cid 16932  df-func 17120  df-setc 17328  df-estrc 17365 This theorem is referenced by:  fthestrcsetc  17392  fullestrcsetc  17393  funcrngcsetc  44617  funcrngcsetcALT  44618  funcringcsetc  44654
 Copyright terms: Public domain W3C validator