| 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 2762 | . . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
| 7 | 1, 2, 3, 4, 5, 6 | invss 17856 | . . . 4 ⊢ (𝜑 → (𝑌𝑁𝑋) ⊆ ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌))) |
| 8 | relxp 5677 | . . . 4 ⊢ Rel ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) | |
| 9 | relss 5766 | . . . 4 ⊢ ((𝑌𝑁𝑋) ⊆ ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) → (Rel ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) → Rel (𝑌𝑁𝑋))) | |
| 10 | 7, 8, 9 | mpisyl 22 | . . 3 ⊢ (𝜑 → Rel (𝑌𝑁𝑋)) |
| 11 | relcnv 6104 | . . 3 ⊢ Rel ◡(𝑋𝑁𝑌) | |
| 12 | 10, 11 | jctil 529 | . 2 ⊢ (𝜑 → (Rel ◡(𝑋𝑁𝑌) ∧ Rel (𝑌𝑁𝑋))) |
| 13 | 1, 2, 3, 5, 4 | invsym 17857 | . . . 4 ⊢ (𝜑 → (𝑓(𝑋𝑁𝑌)𝑔 ↔ 𝑔(𝑌𝑁𝑋)𝑓)) |
| 14 | vex 3457 | . . . . . 6 ⊢ 𝑔 ∈ V | |
| 15 | vex 3457 | . . . . . 6 ⊢ 𝑓 ∈ V | |
| 16 | 14, 15 | brcnv 5866 | . . . . 5 ⊢ (𝑔◡(𝑋𝑁𝑌)𝑓 ↔ 𝑓(𝑋𝑁𝑌)𝑔) |
| 17 | df-br 5108 | . . . . 5 ⊢ (𝑔◡(𝑋𝑁𝑌)𝑓 ↔ 〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌)) | |
| 18 | 16, 17 | bitr3i 280 | . . . 4 ⊢ (𝑓(𝑋𝑁𝑌)𝑔 ↔ 〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌)) |
| 19 | df-br 5108 | . . . 4 ⊢ (𝑔(𝑌𝑁𝑋)𝑓 ↔ 〈𝑔, 𝑓〉 ∈ (𝑌𝑁𝑋)) | |
| 20 | 13, 18, 19 | 3bitr3g 316 | . . 3 ⊢ (𝜑 → (〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌) ↔ 〈𝑔, 𝑓〉 ∈ (𝑌𝑁𝑋))) |
| 21 | 20 | eqrelrdv2 5779 | . 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 2145 ⊆ wss 3902 〈cop 4593 class class class wbr 5107 × cxp 5657 ◡ccnv 5658 Rel wrel 5664 ‘cfv 6537 (class class class)co 7417 Basecbs 17307 Hom chom 17359 Catccat 17758 Invcinv 17840 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-sect 17842 df-inv 17843 |
| This theorem is used by: invf 17863 invf1o 17864 invinv 17865 cicsym 17899 |
| Copyright terms: Public domain | W3C validator |