| 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 2761 | . . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
| 7 | 1, 2, 3, 4, 5, 6 | invss 17916 | . . . 4 ⊢ (𝜑 → (𝑌𝑁𝑋) ⊆ ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌))) |
| 8 | relxp 5669 | . . . 4 ⊢ Rel ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) | |
| 9 | relss 5758 | . . . 4 ⊢ ((𝑌𝑁𝑋) ⊆ ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) → (Rel ((𝑌(Hom ‘𝐶)𝑋) × (𝑋(Hom ‘𝐶)𝑌)) → Rel (𝑌𝑁𝑋))) | |
| 10 | 7, 8, 9 | mpisyl 22 | . . 3 ⊢ (𝜑 → Rel (𝑌𝑁𝑋)) |
| 11 | relcnv 6098 | . . 3 ⊢ Rel ◡(𝑋𝑁𝑌) | |
| 12 | 10, 11 | jctil 529 | . 2 ⊢ (𝜑 → (Rel ◡(𝑋𝑁𝑌) ∧ Rel (𝑌𝑁𝑋))) |
| 13 | 1, 2, 3, 5, 4 | invsym 17917 | . . . 4 ⊢ (𝜑 → (𝑓(𝑋𝑁𝑌)𝑔 ↔ 𝑔(𝑌𝑁𝑋)𝑓)) |
| 14 | vex 3455 | . . . . . 6 ⊢ 𝑔 ∈ V | |
| 15 | vex 3455 | . . . . . 6 ⊢ 𝑓 ∈ V | |
| 16 | 14, 15 | brcnv 5860 | . . . . 5 ⊢ (𝑔◡(𝑋𝑁𝑌)𝑓 ↔ 𝑓(𝑋𝑁𝑌)𝑔) |
| 17 | df-br 5104 | . . . . 5 ⊢ (𝑔◡(𝑋𝑁𝑌)𝑓 ↔ 〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌)) | |
| 18 | 16, 17 | bitr3i 280 | . . . 4 ⊢ (𝑓(𝑋𝑁𝑌)𝑔 ↔ 〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌)) |
| 19 | df-br 5104 | . . . 4 ⊢ (𝑔(𝑌𝑁𝑋)𝑓 ↔ 〈𝑔, 𝑓〉 ∈ (𝑌𝑁𝑋)) | |
| 20 | 13, 18, 19 | 3bitr3g 316 | . . 3 ⊢ (𝜑 → (〈𝑔, 𝑓〉 ∈ ◡(𝑋𝑁𝑌) ↔ 〈𝑔, 𝑓〉 ∈ (𝑌𝑁𝑋))) |
| 21 | 20 | eqrelrdv2 5771 | . 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 3899 〈cop 4590 class class class wbr 5103 × cxp 5649 ◡ccnv 5650 Rel wrel 5656 ‘cfv 6531 (class class class)co 7412 Basecbs 17367 Hom chom 17419 Catccat 17818 Invcinv 17900 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7990 df-2nd 7991 df-sect 17902 df-inv 17903 |
| This theorem is used by: invf 17923 invf1o 17924 invinv 17925 cicsym 17959 |
| Copyright terms: Public domain | W3C validator |