| 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-1onto(𝑌𝐼𝑋)) |
| 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 17995 | . . 3 ⊢ (𝜑 → (𝑋𝑁𝑌):(𝑋𝐼𝑌)⟶(𝑌𝐼𝑋)) |
| 8 | 7 | ffnd 6739 | . 2 ⊢ (𝜑 → (𝑋𝑁𝑌) Fn (𝑋𝐼𝑌)) |
| 9 | 1, 2, 3, 5, 4, 6 | invf 17995 | . . . 4 ⊢ (𝜑 → (𝑌𝑁𝑋):(𝑌𝐼𝑋)⟶(𝑋𝐼𝑌)) |
| 10 | 9 | ffnd 6739 | . . 3 ⊢ (𝜑 → (𝑌𝑁𝑋) Fn (𝑌𝐼𝑋)) |
| 11 | 1, 2, 3, 4, 5 | invsym2 17990 | . . . 4 ⊢ (𝜑 → ◡(𝑋𝑁𝑌) = (𝑌𝑁𝑋)) |
| 12 | 11 | fneq1d 6661 | . . 3 ⊢ (𝜑 → (◡(𝑋𝑁𝑌) Fn (𝑌𝐼𝑋) ↔ (𝑌𝑁𝑋) Fn (𝑌𝐼𝑋))) |
| 13 | 10, 12 | mpbird 260 | . 2 ⊢ (𝜑 → ◡(𝑋𝑁𝑌) Fn (𝑌𝐼𝑋)) |
| 14 | dff1o4 6862 | . 2 ⊢ ((𝑋𝑁𝑌):(𝑋𝐼𝑌)⟶1-1onto(𝑌𝐼𝑋) ↔ ((𝑋𝑁𝑌) Fn (𝑋𝐼𝑌) ∧ ◡(𝑋𝑁𝑌) Fn (𝑌𝐼𝑋))) | |
| 15 | 8, 13, 14 | sylanbrc 595 | 1 ⊢ (𝜑 → (𝑋𝑁𝑌):(𝑋𝐼𝑌)⟶1-1onto(𝑌𝐼𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 ∈ wcel 2150 ◡ccnv 5656 Fn wfn 6560 ⟶1-1ontowf1o 6564 ‘cfv 6565 (class class class)co 7450 Basecbs 17433 Catccat 17890 Invcinv 17972 Isociso 17973 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-1st 8034 df-2nd 8035 df-cat 17894 df-cid 17895 df-sect 17974 df-inv 17975 df-iso 17976 |
| This theorem is used by: invinv 17997 |
| Copyright terms: Public domain | W3C validator |