| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > invf1o | Structured version Visualization version GIF version | ||
| Description: The inverse relation is a bijection from isomorphisms to isomorphisms. This means that every isomorphism 𝐹 ∈ (𝑋𝐼𝑌) has a unique inverse, denoted by ((Inv‘𝐶)‘𝐹). Remark 3.12 of [Adamek] p. 28. (Contributed by Mario Carneiro, 2-Jan-2017.) |
| Ref | Expression |
|---|---|
| invfval.b | ⊢ 𝐵 = (Base‘𝐶) |
| invfval.n | ⊢ 𝑁 = (Inv‘𝐶) |
| invfval.c | ⊢ (𝜑 → 𝐶 ∈ Cat) |
| invss.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| invss.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| isoval.n | ⊢ 𝐼 = (Iso‘𝐶) |
| Ref | Expression |
|---|---|
| invf1o | ⊢ (𝜑 → (𝑋𝑁𝑌):(𝑋𝐼𝑌)–1-1-onto→(𝑌𝐼𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | invfval.b | . . . 4 ⊢ 𝐵 = (Base‘𝐶) | |
| 2 | invfval.n | . . . 4 ⊢ 𝑁 = (Inv‘𝐶) | |
| 3 | invfval.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
| 4 | invss.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 5 | invss.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 6 | isoval.n | . . . 4 ⊢ 𝐼 = (Iso‘𝐶) | |
| 7 | 1, 2, 3, 4, 5, 6 | invf 17857 | . . 3 ⊢ (𝜑 → (𝑋𝑁𝑌):(𝑋𝐼𝑌)⟶(𝑌𝐼𝑋)) |
| 8 | 7 | ffnd 6703 | . 2 ⊢ (𝜑 → (𝑋𝑁𝑌) Fn (𝑋𝐼𝑌)) |
| 9 | 1, 2, 3, 5, 4, 6 | invf 17857 | . . . 4 ⊢ (𝜑 → (𝑌𝑁𝑋):(𝑌𝐼𝑋)⟶(𝑋𝐼𝑌)) |
| 10 | 9 | ffnd 6703 | . . 3 ⊢ (𝜑 → (𝑌𝑁𝑋) Fn (𝑌𝐼𝑋)) |
| 11 | 1, 2, 3, 4, 5 | invsym2 17852 | . . . 4 ⊢ (𝜑 → ◡(𝑋𝑁𝑌) = (𝑌𝑁𝑋)) |
| 12 | 11 | fneq1d 6625 | . . 3 ⊢ (𝜑 → (◡(𝑋𝑁𝑌) Fn (𝑌𝐼𝑋) ↔ (𝑌𝑁𝑋) Fn (𝑌𝐼𝑋))) |
| 13 | 10, 12 | mpbird 260 | . 2 ⊢ (𝜑 → ◡(𝑋𝑁𝑌) Fn (𝑌𝐼𝑋)) |
| 14 | dff1o4 6826 | . 2 ⊢ ((𝑋𝑁𝑌):(𝑋𝐼𝑌)–1-1-onto→(𝑌𝐼𝑋) ↔ ((𝑋𝑁𝑌) Fn (𝑋𝐼𝑌) ∧ ◡(𝑋𝑁𝑌) Fn (𝑌𝐼𝑋))) | |
| 15 | 8, 13, 14 | sylanbrc 595 | 1 ⊢ (𝜑 → (𝑋𝑁𝑌):(𝑋𝐼𝑌)–1-1-onto→(𝑌𝐼𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ◡ccnv 5654 Fn wfn 6528 –1-1-onto→wf1o 6532 ‘cfv 6533 (class class class)co 7413 Basecbs 17301 Catccat 17752 Invcinv 17834 Isociso 17835 |
| 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 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-cat 17756 df-cid 17757 df-sect 17836 df-inv 17837 df-iso 17838 |
| This theorem is used by: invinv 17859 |
| Copyright terms: Public domain | W3C validator |