| 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 18195 | . 2 ⊢ (𝜑 → 𝐹(𝐸 Faith 𝑆)𝐺) |
| 9 | 1, 2, 3, 4, 5, 6, 7 | fullestrcsetc 18196 | . 2 ⊢ (𝜑 → 𝐹(𝐸 Full 𝑆)𝐺) |
| 10 | 2, 5 | setcbas 18123 | . . . . . . . . 9 ⊢ (𝜑 → 𝑈 = (Base‘𝑆)) |
| 11 | 4, 10 | eqtr4id 2796 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 = 𝑈) |
| 12 | 11 | eleq2d 2827 | . . . . . . 7 ⊢ (𝜑 → (𝑏 ∈ 𝐶 ↔ 𝑏 ∈ 𝑈)) |
| 13 | eqid 2737 | . . . . . . . . 9 ⊢ {〈(Base‘ndx), 𝑏〉} = {〈(Base‘ndx), 𝑏〉} | |
| 14 | equivestrcsetc.i | . . . . . . . . 9 ⊢ (𝜑 → (Base‘ndx) ∈ 𝑈) | |
| 15 | 13, 5, 14 | 1strwunbndx 17265 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝑈) → {〈(Base‘ndx), 𝑏〉} ∈ 𝑈) |
| 16 | 15 | ex 412 | . . . . . . 7 ⊢ (𝜑 → (𝑏 ∈ 𝑈 → {〈(Base‘ndx), 𝑏〉} ∈ 𝑈)) |
| 17 | 12, 16 | sylbid 240 | . . . . . 6 ⊢ (𝜑 → (𝑏 ∈ 𝐶 → {〈(Base‘ndx), 𝑏〉} ∈ 𝑈)) |
| 18 | 17 | imp 406 | . . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → {〈(Base‘ndx), 𝑏〉} ∈ 𝑈) |
| 19 | 1, 5 | estrcbas 18169 | . . . . . . 7 ⊢ (𝜑 → 𝑈 = (Base‘𝐸)) |
| 20 | 19 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → 𝑈 = (Base‘𝐸)) |
| 21 | 3, 20 | eqtr4id 2796 | . . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → 𝐵 = 𝑈) |
| 22 | 18, 21 | eleqtrrd 2844 | . . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → {〈(Base‘ndx), 𝑏〉} ∈ 𝐵) |
| 23 | fveq2 6906 | . . . . . . 7 ⊢ (𝑎 = {〈(Base‘ndx), 𝑏〉} → (𝐹‘𝑎) = (𝐹‘{〈(Base‘ndx), 𝑏〉})) | |
| 24 | 23 | f1oeq3d 6845 | . . . . . 6 ⊢ (𝑎 = {〈(Base‘ndx), 𝑏〉} → (𝑖:𝑏–1-1-onto→(𝐹‘𝑎) ↔ 𝑖:𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}))) |
| 25 | 24 | exbidv 1921 | . . . . 5 ⊢ (𝑎 = {〈(Base‘ndx), 𝑏〉} → (∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎) ↔ ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}))) |
| 26 | 25 | adantl 481 | . . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐶) ∧ 𝑎 = {〈(Base‘ndx), 𝑏〉}) → (∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎) ↔ ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}))) |
| 27 | f1oi 6886 | . . . . . 6 ⊢ ( I ↾ 𝑏):𝑏–1-1-onto→𝑏 | |
| 28 | 1, 2, 3, 4, 5, 6 | funcestrcsetclem1 18185 | . . . . . . . . 9 ⊢ ((𝜑 ∧ {〈(Base‘ndx), 𝑏〉} ∈ 𝐵) → (𝐹‘{〈(Base‘ndx), 𝑏〉}) = (Base‘{〈(Base‘ndx), 𝑏〉})) |
| 29 | 22, 28 | syldan 591 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → (𝐹‘{〈(Base‘ndx), 𝑏〉}) = (Base‘{〈(Base‘ndx), 𝑏〉})) |
| 30 | 13 | 1strbas 17263 | . . . . . . . . 9 ⊢ (𝑏 ∈ 𝐶 → 𝑏 = (Base‘{〈(Base‘ndx), 𝑏〉})) |
| 31 | 30 | adantl 481 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → 𝑏 = (Base‘{〈(Base‘ndx), 𝑏〉})) |
| 32 | 29, 31 | eqtr4d 2780 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → (𝐹‘{〈(Base‘ndx), 𝑏〉}) = 𝑏) |
| 33 | 32 | f1oeq3d 6845 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → (( I ↾ 𝑏):𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉}) ↔ ( I ↾ 𝑏):𝑏–1-1-onto→𝑏)) |
| 34 | 27, 33 | mpbiri 258 | . . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → ( I ↾ 𝑏):𝑏–1-1-onto→(𝐹‘{〈(Base‘ndx), 𝑏〉})) |
| 35 | resiexg 7934 | . . . . . . 7 ⊢ (𝑏 ∈ V → ( I ↾ 𝑏) ∈ V) | |
| 36 | 35 | elv 3485 | . . . . . 6 ⊢ ( I ↾ 𝑏) ∈ V |
| 37 | f1oeq1 6836 | . . . . . 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 3624 | . . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐶) → ∃𝑎 ∈ 𝐵 ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎)) |
| 41 | 40 | ralrimiva 3146 | . 2 ⊢ (𝜑 → ∀𝑏 ∈ 𝐶 ∃𝑎 ∈ 𝐵 ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎)) |
| 42 | 8, 9, 41 | 3jca 1129 | 1 ⊢ (𝜑 → (𝐹(𝐸 Faith 𝑆)𝐺 ∧ 𝐹(𝐸 Full 𝑆)𝐺 ∧ ∀𝑏 ∈ 𝐶 ∃𝑎 ∈ 𝐵 ∃𝑖 𝑖:𝑏–1-1-onto→(𝐹‘𝑎))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∃wex 1779 ∈ wcel 2108 ∀wral 3061 ∃wrex 3070 Vcvv 3480 {csn 4626 〈cop 4632 class class class wbr 5143 ↦ cmpt 5225 I cid 5577 ↾ cres 5687 –1-1-onto→wf1o 6560 ‘cfv 6561 (class class class)co 7431 ∈ cmpo 7433 ↑m cmap 8866 WUnicwun 10740 ndxcnx 17230 Basecbs 17247 Full cful 17949 Faith cfth 17950 SetCatcsetc 18120 ExtStrCatcestrc 18166 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-tp 4631 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-map 8868 df-ixp 8938 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-wun 10742 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-2 12329 df-3 12330 df-4 12331 df-5 12332 df-6 12333 df-7 12334 df-8 12335 df-9 12336 df-n0 12527 df-z 12614 df-dec 12734 df-uz 12879 df-fz 13548 df-struct 17184 df-slot 17219 df-ndx 17231 df-base 17248 df-hom 17321 df-cco 17322 df-cat 17711 df-cid 17712 df-func 17903 df-full 17951 df-fth 17952 df-setc 18121 df-estrc 18167 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |