| 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 2766 | . . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
| 7 | 1, 2, 3, 4, 5, 6 | invss 17843 | . . . 4 ⊢ (𝜑 → (𝑌𝑁𝑋) ⊆ ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌))) |
| 8 | relxp 5684 | . . . 4 ⊢ Rel ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) | |
| 9 | relss 5773 | . . . 4 ⊢ ((𝑌𝑁𝑋) ⊆ ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) → (Rel ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) → Rel (𝑌𝑁𝑋))) | |
| 10 | 7, 8, 9 | mpisyl 22 | . . 3 ⊢ (𝜑 → Rel (𝑌𝑁𝑋)) |
| 11 | relcnv 6111 | . . 3 ⊢ Rel ◡(𝑋𝑁𝑌) | |
| 12 | 10, 11 | jctil 529 | . 2 ⊢ (𝜑 → (Rel ◡(𝑋𝑁𝑌) ∧ Rel (𝑌𝑁𝑋))) |
| 13 | 1, 2, 3, 5, 4 | invsym 17844 | . . . 4 ⊢ (𝜑 → (𝑓(𝑋𝑁𝑌)𝑔 ↔ 𝑔(𝑌𝑁𝑋)𝑓)) |
| 14 | vex 3462 | . . . . . 6 ⊢ 𝑔 ∈ V | |
| 15 | vex 3462 | . . . . . 6 ⊢ 𝑓 ∈ V | |
| 16 | 14, 15 | brcnv 5873 | . . . . 5 ⊢ (𝑔◡(𝑋𝑁𝑌)𝑓 ↔ 𝑓(𝑋𝑁𝑌)𝑔) |
| 17 | df-br 5115 | . . . . 5 ⊢ (𝑔◡(𝑋𝑁𝑌)𝑓 ↔ 〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌)) | |
| 18 | 16, 17 | bitr3i 280 | . . . 4 ⊢ (𝑓(𝑋𝑁𝑌)𝑔 ↔ 〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌)) |
| 19 | df-br 5115 | . . . 4 ⊢ (𝑔(𝑌𝑁𝑋)𝑓 ↔ 〈𝑔, 𝑓〉 ∈ (𝑌𝑁𝑋)) | |
| 20 | 13, 18, 19 | 3bitr3g 316 | . . 3 ⊢ (𝜑 → (〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌) ↔ 〈𝑔, 𝑓〉 ∈ (𝑌𝑁𝑋))) |
| 21 | 20 | eqrelrdv2 5786 | . 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 2146 ⊆ wss 3908 〈cop 4600 class class class wbr 5114 × cxp 5664 ◡ccnv 5665 Rel wrel 5671 ‘cfv 6543 (class class class)co 7423 Basecbs 17294 Hom chom 17346 Catccat 17745 Invcinv 17827 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7426 df-oprab 7427 df-mpo 7428 df-1st 7995 df-2nd 7996 df-sect 17829 df-inv 17830 |
| This theorem is used by: invf 17850 invf1o 17851 invinv 17852 cicsym 17886 |
| Copyright terms: Public domain | W3C validator |