Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > equivestrcsetc | Structured version Visualization version GIF version |
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 an equivalence. According to definition 3.33 (1) of [Adamek] p. 36, "A functor F : A -> B is called an equivalence provided that it is full, faithful, and isomorphism-dense in the sense that for any B-object B' there exists some A-object A' such that F(A') is isomorphic to B'.". Therefore, the category of sets and the category of extensible structures are equivalent, according to definition 3.33 (2) of [Adamek] p. 36, "Categories A and B are called equivalent provided that there is an equivalence from A to B.". (Contributed by AV, 2-Apr-2020.) |
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‘𝑥))))) |
equivestrcsetc.i | ⊢ (𝜑 → (Base‘ndx) ∈ 𝑈) |
Ref | Expression |
---|---|
equivestrcsetc | ⊢ (𝜑 → (𝐹(𝐸 Faith 𝑆)𝐺 ∧ 𝐹(𝐸 Full 𝑆)𝐺 ∧ ∀𝑏 ∈ 𝐶 ∃𝑎 ∈ 𝐵 ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎))) |
Step | Hyp | Ref | 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‘𝑥))))) | |
8 | 1, 2, 3, 4, 5, 6, 7 | fthestrcsetc 17399 | . 2 ⊢ (𝜑 → 𝐹(𝐸 Faith 𝑆)𝐺) |
9 | 1, 2, 3, 4, 5, 6, 7 | fullestrcsetc 17400 | . 2 ⊢ (𝜑 → 𝐹(𝐸 Full 𝑆)𝐺) |
10 | 2, 5 | setcbas 17337 | . . . . . . . . 9 ⊢ (𝜑 → 𝑈 = (Base‘𝑆)) |
11 | 10, 4 | syl6reqr 2875 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 = 𝑈) |
12 | 11 | eleq2d 2898 | . . . . . . 7 ⊢ (𝜑 → (𝑏 ∈ 𝐶 ↔ 𝑏 ∈ 𝑈)) |
13 | eqid 2821 | . . . . . . . . 9 ⊢ {〈(Base‘ndx), 𝑏〉} = {〈(Base‘ndx), 𝑏〉} | |
14 | equivestrcsetc.i | . . . . . . . . 9 ⊢ (𝜑 → (Base‘ndx) ∈ 𝑈) | |
15 | 13, 5, 14 | 1strwunbndx 16599 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝑈) → {〈(Base‘ndx), 𝑏〉} ∈ 𝑈) |
16 | 15 | ex 415 | . . . . . . 7 ⊢ (𝜑 → (𝑏 ∈ 𝑈 → {〈(Base‘ndx), 𝑏〉} ∈ 𝑈)) |
17 | 12, 16 | sylbid 242 | . . . . . 6 ⊢ (𝜑 → (𝑏 ∈ 𝐶 → {〈(Base‘ndx), 𝑏〉} ∈ 𝑈)) |
18 | 17 | imp 409 | . . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → {〈(Base‘ndx), 𝑏〉} ∈ 𝑈) |
19 | 1, 5 | estrcbas 17374 | . . . . . . 7 ⊢ (𝜑 → 𝑈 = (Base‘𝐸)) |
20 | 19 | adantr 483 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → 𝑈 = (Base‘𝐸)) |
21 | 20, 3 | syl6reqr 2875 | . . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → 𝐵 = 𝑈) |
22 | 18, 21 | eleqtrrd 2916 | . . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → {〈(Base‘ndx), 𝑏〉} ∈ 𝐵) |
23 | fveq2 6669 | . . . . . . 7 ⊢ (𝑎 = {〈(Base‘ndx), 𝑏〉} → (𝐹‘𝑎) = (𝐹‘{〈(Base‘ndx), 𝑏〉})) | |
24 | 23 | f1oeq3d 6611 | . . . . . 6 ⊢ (𝑎 = {〈(Base‘ndx), 𝑏〉} → (𝑖:𝑏–1-1-onto→(𝐹‘𝑎) ↔ 𝑖:𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}))) |
25 | 24 | exbidv 1918 | . . . . 5 ⊢ (𝑎 = {〈(Base‘ndx), 𝑏〉} → (∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎) ↔ ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}))) |
26 | 25 | adantl 484 | . . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐶) ∧ 𝑎 = {〈(Base‘ndx), 𝑏〉}) → (∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎) ↔ ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}))) |
27 | f1oi 6651 | . . . . . 6 ⊢ ( I ↾ 𝑏):𝑏–1-1-onto→𝑏 | |
28 | 1, 2, 3, 4, 5, 6 | funcestrcsetclem1 17389 | . . . . . . . . 9 ⊢ ((𝜑 ∧ {〈(Base‘ndx), 𝑏〉} ∈ 𝐵) → (𝐹‘{〈(Base‘ndx), 𝑏〉}) = (Base‘{〈(Base‘ndx), 𝑏〉})) |
29 | 22, 28 | syldan 593 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → (𝐹‘{〈(Base‘ndx), 𝑏〉}) = (Base‘{〈(Base‘ndx), 𝑏〉})) |
30 | 13 | 1strbas 16598 | . . . . . . . . 9 ⊢ (𝑏 ∈ 𝐶 → 𝑏 = (Base‘{〈(Base‘ndx), 𝑏〉})) |
31 | 30 | adantl 484 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → 𝑏 = (Base‘{〈(Base‘ndx), 𝑏〉})) |
32 | 29, 31 | eqtr4d 2859 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → (𝐹‘{〈(Base‘ndx), 𝑏〉}) = 𝑏) |
33 | 32 | f1oeq3d 6611 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → (( I ↾ 𝑏):𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}) ↔ ( I ↾ 𝑏):𝑏–1-1-onto→𝑏)) |
34 | 27, 33 | mpbiri 260 | . . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → ( I ↾ 𝑏):𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉})) |
35 | resiexg 7618 | . . . . . . 7 ⊢ (𝑏 ∈ V → ( I ↾ 𝑏) ∈ V) | |
36 | 35 | elv 3499 | . . . . . 6 ⊢ ( I ↾ 𝑏) ∈ V |
37 | f1oeq1 6603 | . . . . . 6 ⊢ (𝑖 = ( I ↾ 𝑏) → (𝑖:𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}) ↔ ( I ↾ 𝑏):𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}))) | |
38 | 36, 37 | spcev 3606 | . . . . 5 ⊢ (( I ↾ 𝑏):𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}) → ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉})) |
39 | 34, 38 | syl 17 | . . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉})) |
40 | 22, 26, 39 | rspcedvd 3625 | . . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → ∃𝑎 ∈ 𝐵 ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎)) |
41 | 40 | ralrimiva 3182 | . 2 ⊢ (𝜑 → ∀𝑏 ∈ 𝐶 ∃𝑎 ∈ 𝐵 ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎)) |
42 | 8, 9, 41 | 3jca 1124 | 1 ⊢ (𝜑 → (𝐹(𝐸 Faith 𝑆)𝐺 ∧ 𝐹(𝐸 Full 𝑆)𝐺 ∧ ∀𝑏 ∈ 𝐶 ∃𝑎 ∈ 𝐵 ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∃wex 1776 ∈ wcel 2110 ∀wral 3138 ∃wrex 3139 Vcvv 3494 {csn 4566 〈cop 4572 class class class wbr 5065 ↦ cmpt 5145 I cid 5458 ↾ cres 5556 –1-1-onto→wf1o 6353 ‘cfv 6354 (class class class)co 7155 ∈ cmpo 7157 ↑m cmap 8405 WUnicwun 10121 ndxcnx 16479 Basecbs 16482 Full cful 17171 Faith cfth 17172 SetCatcsetc 17334 ExtStrCatcestrc 17371 |
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 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-oadd 8105 df-er 8288 df-map 8407 df-ixp 8461 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-wun 10123 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-2 11699 df-3 11700 df-4 11701 df-5 11702 df-6 11703 df-7 11704 df-8 11705 df-9 11706 df-n0 11897 df-z 11981 df-dec 12098 df-uz 12243 df-fz 12892 df-struct 16484 df-ndx 16485 df-slot 16486 df-base 16488 df-hom 16588 df-cco 16589 df-cat 16938 df-cid 16939 df-func 17127 df-full 17173 df-fth 17174 df-setc 17335 df-estrc 17372 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |