| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > invsym2 | Structured version Visualization version GIF version | ||
| Description: The inverse relation is symmetric. (Contributed by Mario Carneiro, 2-Jan-2017.) |
| Ref | Expression |
|---|---|
| invfval.b | ⊢ 𝐵 = (Base‘𝐶) |
| invfval.n | ⊢ 𝑁 = (Inv‘𝐶) |
| invfval.c | ⊢ (𝜑 → 𝐶 ∈ Cat) |
| invss.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| invss.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| invsym2 | ⊢ (𝜑 → ◡(𝑋𝑁𝑌) = (𝑌𝑁𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | invfval.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐶) | |
| 2 | invfval.n | . . . . 5 ⊢ 𝑁 = (Inv‘𝐶) | |
| 3 | invfval.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
| 4 | invss.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 5 | invss.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 6 | eqid 2763 | . . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
| 7 | 1, 2, 3, 4, 5, 6 | invss 17968 | . . . 4 ⊢ (𝜑 → (𝑌𝑁𝑋) ⊆ ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌))) |
| 8 | relxp 5674 | . . . 4 ⊢ Rel ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) | |
| 9 | relss 5764 | . . . 4 ⊢ ((𝑌𝑁𝑋) ⊆ ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) → (Rel ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) → Rel (𝑌𝑁𝑋))) | |
| 10 | 7, 8, 9 | mpisyl 22 | . . 3 ⊢ (𝜑 → Rel (𝑌𝑁𝑋)) |
| 11 | relcnv 6113 | . . 3 ⊢ Rel ◡(𝑋𝑁𝑌) | |
| 12 | 10, 11 | jctil 529 | . 2 ⊢ (𝜑 → (Rel ◡(𝑋𝑁𝑌) ∧ Rel (𝑌𝑁𝑋))) |
| 13 | 1, 2, 3, 5, 4 | invsym 17969 | . . . 4 ⊢ (𝜑 → (𝑓(𝑋𝑁𝑌)𝑔 ↔ 𝑔(𝑌𝑁𝑋)𝑓)) |
| 14 | vex 3458 | . . . . . 6 ⊢ 𝑔 ∈ V | |
| 15 | vex 3458 | . . . . . 6 ⊢ 𝑓 ∈ V | |
| 16 | 14, 15 | brcnv 5868 | . . . . 5 ⊢ (𝑔◡(𝑋𝑁𝑌)𝑓 ↔ 𝑓(𝑋𝑁𝑌)𝑔) |
| 17 | df-br 5107 | . . . . 5 ⊢ (𝑔◡(𝑋𝑁𝑌)𝑓 ↔ 〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌)) | |
| 18 | 16, 17 | bitr3i 280 | . . . 4 ⊢ (𝑓(𝑋𝑁𝑌)𝑔 ↔ 〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌)) |
| 19 | df-br 5107 | . . . 4 ⊢ (𝑔(𝑌𝑁𝑋)𝑓 ↔ 〈𝑔, 𝑓〉 ∈ (𝑌𝑁𝑋)) | |
| 20 | 13, 18, 19 | 3bitr3g 316 | . . 3 ⊢ (𝜑 → (〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌) ↔ 〈𝑔, 𝑓〉 ∈ (𝑌𝑁𝑋))) |
| 21 | 20 | eqrelrdv2 5777 | . 2 ⊢ (((Rel ◡(𝑋𝑁𝑌) ∧ Rel (𝑌𝑁𝑋)) ∧ 𝜑) → ◡(𝑋𝑁𝑌) = (𝑌𝑁𝑋)) |
| 22 | 12, 21 | mpancom 701 | 1 ⊢ (𝜑 → ◡(𝑋𝑁𝑌) = (𝑌𝑁𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 〈cop 4838 class class class wbr 5106 × cxp 5654 ◡ccnv 5655 Rel wrel 5661 ‘cfv 6561 (class class class)co 7446 Basecbs 17419 Hom chom 17471 Catccat 17870 Invcinv 17952 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-ov 7449 df-oprab 7450 df-mpo 7451 df-1st 8028 df-2nd 8029 df-sect 17954 df-inv 17955 |
| This theorem is used by: invf 17975 invf1o 17976 invinv 17977 cicsym 18011 |
| Copyright terms: Public domain | W3C validator |