| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > setciso | Structured version Visualization version GIF version | ||
| Description: An isomorphism in the category of sets is a bijection. (Contributed by Mario Carneiro, 3-Jan-2017.) |
| Ref | Expression |
|---|---|
| setcmon.c | ⊢ 𝐶 = (SetCat‘𝑈) |
| setcmon.u | ⊢ (𝜑 → 𝑈 ∈ 𝑉) |
| setcmon.x | ⊢ (𝜑 → 𝑋 ∈ 𝑈) |
| setcmon.y | ⊢ (𝜑 → 𝑌 ∈ 𝑈) |
| setciso.n | ⊢ 𝐼 = (Iso‘𝐶) |
| Ref | Expression |
|---|---|
| setciso | ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹:𝑋–1-1-onto→𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2761 | . . . 4 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
| 2 | eqid 2761 | . . . 4 ⊢ (Inv‘𝐶) = (Inv‘𝐶) | |
| 3 | setcmon.u | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
| 4 | setcmon.c | . . . . . 6 ⊢ 𝐶 = (SetCat‘𝑈) | |
| 5 | 4 | setccat 18260 | . . . . 5 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat) |
| 6 | 3, 5 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat) |
| 7 | setcmon.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑈) | |
| 8 | 4, 3 | setcbas 18253 | . . . . 5 ⊢ (𝜑 → 𝑈 = (Base‘𝐶)) |
| 9 | 7, 8 | eleqtrd 2863 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶)) |
| 10 | setcmon.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑈) | |
| 11 | 10, 8 | eleqtrd 2863 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶)) |
| 12 | setciso.n | . . . 4 ⊢ 𝐼 = (Iso‘𝐶) | |
| 13 | 1, 2, 6, 9, 11, 12 | isoval 17940 | . . 3 ⊢ (𝜑 → (𝑋𝐼𝑌) = dom (𝑋(Inv‘𝐶)𝑌)) |
| 14 | 13 | eleq2d 2847 | . 2 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌))) |
| 15 | 1, 2, 6, 9, 11 | invfun 17939 | . . . . 5 ⊢ (𝜑 → Fun (𝑋(Inv‘𝐶)𝑌)) |
| 16 | funfvbrb 7050 | . . . . 5 ⊢ (Fun (𝑋(Inv‘𝐶)𝑌) → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹))) | |
| 17 | 15, 16 | syl 18 | . . . 4 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹))) |
| 18 | 4, 3, 7, 10, 2 | setcinv 18265 | . . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹) ↔ (𝐹:𝑋–1-1-onto→𝑌 ∧ ((𝑋(Inv‘𝐶)𝑌)‘𝐹) = ◡𝐹))) |
| 19 | simpl 488 | . . . . 5 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ((𝑋(Inv‘𝐶)𝑌)‘𝐹) = ◡𝐹) → 𝐹:𝑋–1-1-onto→𝑌) | |
| 20 | 18, 19 | biimtrdi 256 | . . . 4 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹) → 𝐹:𝑋–1-1-onto→𝑌)) |
| 21 | 17, 20 | sylbid 243 | . . 3 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) → 𝐹:𝑋–1-1-onto→𝑌)) |
| 22 | eqid 2761 | . . . 4 ⊢ ◡𝐹 = ◡𝐹 | |
| 23 | 4, 3, 7, 10, 2 | setcinv 18265 | . . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)◡𝐹 ↔ (𝐹:𝑋–1-1-onto→𝑌 ∧ ◡𝐹 = ◡𝐹))) |
| 24 | funrel 6556 | . . . . . . 7 ⊢ (Fun (𝑋(Inv‘𝐶)𝑌) → Rel (𝑋(Inv‘𝐶)𝑌)) | |
| 25 | 15, 24 | syl 18 | . . . . . 6 ⊢ (𝜑 → Rel (𝑋(Inv‘𝐶)𝑌)) |
| 26 | releldm 5926 | . . . . . . 7 ⊢ ((Rel (𝑋(Inv‘𝐶)𝑌) ∧ 𝐹(𝑋(Inv‘𝐶)𝑌)◡𝐹) → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)) | |
| 27 | 26 | ex 418 | . . . . . 6 ⊢ (Rel (𝑋(Inv‘𝐶)𝑌) → (𝐹(𝑋(Inv‘𝐶)𝑌)◡𝐹 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌))) |
| 28 | 25, 27 | syl 18 | . . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)◡𝐹 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌))) |
| 29 | 23, 28 | sylbird 263 | . . . 4 ⊢ (𝜑 → ((𝐹:𝑋–1-1-onto→𝑌 ∧ ◡𝐹 = ◡𝐹) → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌))) |
| 30 | 22, 29 | mpan2i 710 | . . 3 ⊢ (𝜑 → (𝐹:𝑋–1-1-onto→𝑌 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌))) |
| 31 | 21, 30 | impbid 215 | . 2 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹:𝑋–1-1-onto→𝑌)) |
| 32 | 14, 31 | bitrd 282 | 1 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹:𝑋–1-1-onto→𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ◡ccnv 5650 dom cdm 5651 Rel wrel 5656 Fun wfun 6532 –1-1-onto→wf1o 6537 ‘cfv 6538 (class class class)co 7420 Basecbs 17387 Catccat 17838 Invcinv 17920 Isociso 17921 SetCatcsetc 18250 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-er 8717 df-map 8849 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-5 12408 df-6 12409 df-7 12410 df-8 12411 df-9 12412 df-n0 12607 df-z 12694 df-dec 12815 df-uz 12966 df-fz 13640 df-struct 17325 df-slot 17360 df-ndx 17372 df-base 17388 df-hom 17452 df-cco 17453 df-cat 17842 df-cid 17843 df-sect 17922 df-inv 17923 df-iso 17924 df-setc 18251 |
| This theorem is used by: yonffthlem 18456 |
| Copyright terms: Public domain | W3C validator |