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

Theorem fullestrcsetc 18207
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 is full. (Contributed by AV, 2-Apr-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
fullestrcsetc (𝜑𝐹(𝐸 Full 𝑆)𝐺)
Distinct variable groups:   𝑥,𝐵   𝜑,𝑥   𝑥,𝐶   𝑦,𝐵,𝑥   𝜑,𝑦
Allowed substitution hints:   𝐶(𝑦)   𝑆(𝑥,𝑦)   𝑈(𝑥,𝑦)   𝐸(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝐺(𝑥,𝑦)

Proof of Theorem fullestrcsetc
Dummy variables 𝑎 𝑏 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 funcestrcsetc.e . . 3 𝐸 = (ExtStrCat‘𝑈)
2 funcestrcsetc.s . . 3 𝑆 = (SetCat‘𝑈)
3 funcestrcsetc.b . . 3 𝐵 = (Base‘𝐸)
4 funcestrcsetc.c . . 3 𝐶 = (Base‘𝑆)
5 funcestrcsetc.u . . 3 (𝜑𝑈 ∈ WUni)
6 funcestrcsetc.f . . 3 (𝜑𝐹 = (𝑥𝐵 ↦ (Base‘𝑥)))
7 funcestrcsetc.g . . 3 (𝜑𝐺 = (𝑥𝐵, 𝑦𝐵 ↦ ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥)))))
81, 2, 3, 4, 5, 6, 7funcestrcsetc 18205 . 2 (𝜑𝐹(𝐸 Func 𝑆)𝐺)
91, 2, 3, 4, 5, 6, 7funcestrcsetclem8 18203 . . . 4 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝑎𝐺𝑏):(𝑎(Hom ‘𝐸)𝑏)⟶((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)))
105adantr 480 . . . . . . . 8 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → 𝑈 ∈ WUni)
11 eqid 2735 . . . . . . . 8 (Hom ‘𝑆) = (Hom ‘𝑆)
121, 2, 3, 4, 5, 6funcestrcsetclem2 18197 . . . . . . . . 9 ((𝜑𝑎𝐵) → (𝐹𝑎) ∈ 𝑈)
1312adantrr 717 . . . . . . . 8 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝐹𝑎) ∈ 𝑈)
141, 2, 3, 4, 5, 6funcestrcsetclem2 18197 . . . . . . . . 9 ((𝜑𝑏𝐵) → (𝐹𝑏) ∈ 𝑈)
1514adantrl 716 . . . . . . . 8 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝐹𝑏) ∈ 𝑈)
162, 10, 11, 13, 15elsetchom 18135 . . . . . . 7 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → ( ∈ ((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)) ↔ :(𝐹𝑎)⟶(𝐹𝑏)))
171, 2, 3, 4, 5, 6funcestrcsetclem1 18196 . . . . . . . . 9 ((𝜑𝑎𝐵) → (𝐹𝑎) = (Base‘𝑎))
1817adantrr 717 . . . . . . . 8 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝐹𝑎) = (Base‘𝑎))
191, 2, 3, 4, 5, 6funcestrcsetclem1 18196 . . . . . . . . 9 ((𝜑𝑏𝐵) → (𝐹𝑏) = (Base‘𝑏))
2019adantrl 716 . . . . . . . 8 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝐹𝑏) = (Base‘𝑏))
2118, 20feq23d 6732 . . . . . . 7 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (:(𝐹𝑎)⟶(𝐹𝑏) ↔ :(Base‘𝑎)⟶(Base‘𝑏)))
2216, 21bitrd 279 . . . . . 6 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → ( ∈ ((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)) ↔ :(Base‘𝑎)⟶(Base‘𝑏)))
23 fvex 6920 . . . . . . . . . . . . 13 (Base‘𝑏) ∈ V
24 fvex 6920 . . . . . . . . . . . . 13 (Base‘𝑎) ∈ V
2523, 24pm3.2i 470 . . . . . . . . . . . 12 ((Base‘𝑏) ∈ V ∧ (Base‘𝑎) ∈ V)
26 elmapg 8878 . . . . . . . . . . . 12 (((Base‘𝑏) ∈ V ∧ (Base‘𝑎) ∈ V) → ( ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) ↔ :(Base‘𝑎)⟶(Base‘𝑏)))
2725, 26mp1i 13 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → ( ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) ↔ :(Base‘𝑎)⟶(Base‘𝑏)))
2827biimpar 477 . . . . . . . . . 10 (((𝜑 ∧ (𝑎𝐵𝑏𝐵)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) → ∈ ((Base‘𝑏) ↑m (Base‘𝑎)))
29 equequ2 2023 . . . . . . . . . . 11 (𝑘 = → ( = 𝑘 = ))
3029adantl 481 . . . . . . . . . 10 ((((𝜑 ∧ (𝑎𝐵𝑏𝐵)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) ∧ 𝑘 = ) → ( = 𝑘 = ))
31 eqidd 2736 . . . . . . . . . 10 (((𝜑 ∧ (𝑎𝐵𝑏𝐵)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) → = )
3228, 30, 31rspcedvd 3624 . . . . . . . . 9 (((𝜑 ∧ (𝑎𝐵𝑏𝐵)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) → ∃𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) = 𝑘)
33 eqid 2735 . . . . . . . . . . . . . 14 (Base‘𝑎) = (Base‘𝑎)
34 eqid 2735 . . . . . . . . . . . . . 14 (Base‘𝑏) = (Base‘𝑏)
351, 2, 3, 4, 5, 6, 7, 33, 34funcestrcsetclem6 18201 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑎𝐵𝑏𝐵) ∧ 𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎))) → ((𝑎𝐺𝑏)‘𝑘) = 𝑘)
36353expa 1117 . . . . . . . . . . . 12 (((𝜑 ∧ (𝑎𝐵𝑏𝐵)) ∧ 𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎))) → ((𝑎𝐺𝑏)‘𝑘) = 𝑘)
3736eqeq2d 2746 . . . . . . . . . . 11 (((𝜑 ∧ (𝑎𝐵𝑏𝐵)) ∧ 𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎))) → ( = ((𝑎𝐺𝑏)‘𝑘) ↔ = 𝑘))
3837rexbidva 3175 . . . . . . . . . 10 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (∃𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) = ((𝑎𝐺𝑏)‘𝑘) ↔ ∃𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) = 𝑘))
3938adantr 480 . . . . . . . . 9 (((𝜑 ∧ (𝑎𝐵𝑏𝐵)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) → (∃𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) = ((𝑎𝐺𝑏)‘𝑘) ↔ ∃𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) = 𝑘))
4032, 39mpbird 257 . . . . . . . 8 (((𝜑 ∧ (𝑎𝐵𝑏𝐵)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) → ∃𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) = ((𝑎𝐺𝑏)‘𝑘))
41 eqid 2735 . . . . . . . . . . 11 (Hom ‘𝐸) = (Hom ‘𝐸)
421, 5estrcbas 18180 . . . . . . . . . . . . . . . 16 (𝜑𝑈 = (Base‘𝐸))
433, 42eqtr4id 2794 . . . . . . . . . . . . . . 15 (𝜑𝐵 = 𝑈)
4443eleq2d 2825 . . . . . . . . . . . . . 14 (𝜑 → (𝑎𝐵𝑎𝑈))
4544biimpcd 249 . . . . . . . . . . . . 13 (𝑎𝐵 → (𝜑𝑎𝑈))
4645adantr 480 . . . . . . . . . . . 12 ((𝑎𝐵𝑏𝐵) → (𝜑𝑎𝑈))
4746impcom 407 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → 𝑎𝑈)
4843eleq2d 2825 . . . . . . . . . . . . . 14 (𝜑 → (𝑏𝐵𝑏𝑈))
4948biimpcd 249 . . . . . . . . . . . . 13 (𝑏𝐵 → (𝜑𝑏𝑈))
5049adantl 481 . . . . . . . . . . . 12 ((𝑎𝐵𝑏𝐵) → (𝜑𝑏𝑈))
5150impcom 407 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → 𝑏𝑈)
521, 10, 41, 47, 51, 33, 34estrchom 18182 . . . . . . . . . 10 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝑎(Hom ‘𝐸)𝑏) = ((Base‘𝑏) ↑m (Base‘𝑎)))
5352rexeqdv 3325 . . . . . . . . 9 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (∃𝑘 ∈ (𝑎(Hom ‘𝐸)𝑏) = ((𝑎𝐺𝑏)‘𝑘) ↔ ∃𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) = ((𝑎𝐺𝑏)‘𝑘)))
5453adantr 480 . . . . . . . 8 (((𝜑 ∧ (𝑎𝐵𝑏𝐵)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) → (∃𝑘 ∈ (𝑎(Hom ‘𝐸)𝑏) = ((𝑎𝐺𝑏)‘𝑘) ↔ ∃𝑘 ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) = ((𝑎𝐺𝑏)‘𝑘)))
5540, 54mpbird 257 . . . . . . 7 (((𝜑 ∧ (𝑎𝐵𝑏𝐵)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) → ∃𝑘 ∈ (𝑎(Hom ‘𝐸)𝑏) = ((𝑎𝐺𝑏)‘𝑘))
5655ex 412 . . . . . 6 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (:(Base‘𝑎)⟶(Base‘𝑏) → ∃𝑘 ∈ (𝑎(Hom ‘𝐸)𝑏) = ((𝑎𝐺𝑏)‘𝑘)))
5722, 56sylbid 240 . . . . 5 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → ( ∈ ((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)) → ∃𝑘 ∈ (𝑎(Hom ‘𝐸)𝑏) = ((𝑎𝐺𝑏)‘𝑘)))
5857ralrimiv 3143 . . . 4 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → ∀ ∈ ((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏))∃𝑘 ∈ (𝑎(Hom ‘𝐸)𝑏) = ((𝑎𝐺𝑏)‘𝑘))
59 dffo3 7122 . . . 4 ((𝑎𝐺𝑏):(𝑎(Hom ‘𝐸)𝑏)–onto→((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)) ↔ ((𝑎𝐺𝑏):(𝑎(Hom ‘𝐸)𝑏)⟶((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)) ∧ ∀ ∈ ((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏))∃𝑘 ∈ (𝑎(Hom ‘𝐸)𝑏) = ((𝑎𝐺𝑏)‘𝑘)))
609, 58, 59sylanbrc 583 . . 3 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝑎𝐺𝑏):(𝑎(Hom ‘𝐸)𝑏)–onto→((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)))
6160ralrimivva 3200 . 2 (𝜑 → ∀𝑎𝐵𝑏𝐵 (𝑎𝐺𝑏):(𝑎(Hom ‘𝐸)𝑏)–onto→((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏)))
623, 11, 41isfull2 17965 . 2 (𝐹(𝐸 Full 𝑆)𝐺 ↔ (𝐹(𝐸 Func 𝑆)𝐺 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎𝐺𝑏):(𝑎(Hom ‘𝐸)𝑏)–onto→((𝐹𝑎)(Hom ‘𝑆)(𝐹𝑏))))
638, 61, 62sylanbrc 583 1 (𝜑𝐹(𝐸 Full 𝑆)𝐺)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2106  wral 3059  wrex 3068  Vcvv 3478   class class class wbr 5148  cmpt 5231   I cid 5582  cres 5691  wf 6559  ontowfo 6561  cfv 6563  (class class class)co 7431  cmpo 7433  m cmap 8865  WUnicwun 10738  Basecbs 17245  Hom chom 17309   Func cfunc 17905   Full cful 17956  SetCatcsetc 18129  ExtStrCatcestrc 18177
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-tp 4636  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-er 8744  df-map 8867  df-ixp 8937  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-wun 10740  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-nn 12265  df-2 12327  df-3 12328  df-4 12329  df-5 12330  df-6 12331  df-7 12332  df-8 12333  df-9 12334  df-n0 12525  df-z 12612  df-dec 12732  df-uz 12877  df-fz 13545  df-struct 17181  df-slot 17216  df-ndx 17228  df-base 17246  df-hom 17322  df-cco 17323  df-cat 17713  df-cid 17714  df-func 17909  df-full 17958  df-setc 18130  df-estrc 18178
This theorem is referenced by:  equivestrcsetc  18208
  Copyright terms: Public domain W3C validator