Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ercnv | Structured version Visualization version GIF version |
Description: The converse of an equivalence relation is itself. (Contributed by Mario Carneiro, 12-Aug-2015.) |
Ref | Expression |
---|---|
ercnv | ⊢ (𝑅 Er 𝐴 → ◡𝑅 = 𝑅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | errel 7638 | . 2 ⊢ (𝑅 Er 𝐴 → Rel 𝑅) | |
2 | relcnv 5422 | . . 3 ⊢ Rel ◡𝑅 | |
3 | id 22 | . . . . . 6 ⊢ (𝑅 Er 𝐴 → 𝑅 Er 𝐴) | |
4 | 3 | ersymb 7643 | . . . . 5 ⊢ (𝑅 Er 𝐴 → (𝑦𝑅𝑥 ↔ 𝑥𝑅𝑦)) |
5 | vex 3176 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
6 | vex 3176 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
7 | 5, 6 | brcnv 5227 | . . . . . 6 ⊢ (𝑥◡𝑅𝑦 ↔ 𝑦𝑅𝑥) |
8 | df-br 4584 | . . . . . 6 ⊢ (𝑥◡𝑅𝑦 ↔ 〈𝑥, 𝑦〉 ∈ ◡𝑅) | |
9 | 7, 8 | bitr3i 265 | . . . . 5 ⊢ (𝑦𝑅𝑥 ↔ 〈𝑥, 𝑦〉 ∈ ◡𝑅) |
10 | df-br 4584 | . . . . 5 ⊢ (𝑥𝑅𝑦 ↔ 〈𝑥, 𝑦〉 ∈ 𝑅) | |
11 | 4, 9, 10 | 3bitr3g 301 | . . . 4 ⊢ (𝑅 Er 𝐴 → (〈𝑥, 𝑦〉 ∈ ◡𝑅 ↔ 〈𝑥, 𝑦〉 ∈ 𝑅)) |
12 | 11 | eqrelrdv2 5142 | . . 3 ⊢ (((Rel ◡𝑅 ∧ Rel 𝑅) ∧ 𝑅 Er 𝐴) → ◡𝑅 = 𝑅) |
13 | 2, 12 | mpanl1 712 | . 2 ⊢ ((Rel 𝑅 ∧ 𝑅 Er 𝐴) → ◡𝑅 = 𝑅) |
14 | 1, 13 | mpancom 700 | 1 ⊢ (𝑅 Er 𝐴 → ◡𝑅 = 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1475 ∈ wcel 1977 〈cop 4131 class class class wbr 4583 ◡ccnv 5037 Rel wrel 5043 Er wer 7626 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-br 4584 df-opab 4644 df-xp 5044 df-rel 5045 df-cnv 5046 df-er 7629 |
This theorem is referenced by: errn 7651 |
Copyright terms: Public domain | W3C validator |