Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ercnv | 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 6438 | . 2 ⊢ (𝑅 Er 𝐴 → Rel 𝑅) | |
2 | relcnv 4917 | . . 3 ⊢ Rel ◡𝑅 | |
3 | id 19 | . . . . . 6 ⊢ (𝑅 Er 𝐴 → 𝑅 Er 𝐴) | |
4 | 3 | ersymb 6443 | . . . . 5 ⊢ (𝑅 Er 𝐴 → (𝑦𝑅𝑥 ↔ 𝑥𝑅𝑦)) |
5 | vex 2689 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
6 | vex 2689 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
7 | 5, 6 | brcnv 4722 | . . . . . 6 ⊢ (𝑥◡𝑅𝑦 ↔ 𝑦𝑅𝑥) |
8 | df-br 3930 | . . . . . 6 ⊢ (𝑥◡𝑅𝑦 ↔ 〈𝑥, 𝑦〉 ∈ ◡𝑅) | |
9 | 7, 8 | bitr3i 185 | . . . . 5 ⊢ (𝑦𝑅𝑥 ↔ 〈𝑥, 𝑦〉 ∈ ◡𝑅) |
10 | df-br 3930 | . . . . 5 ⊢ (𝑥𝑅𝑦 ↔ 〈𝑥, 𝑦〉 ∈ 𝑅) | |
11 | 4, 9, 10 | 3bitr3g 221 | . . . 4 ⊢ (𝑅 Er 𝐴 → (〈𝑥, 𝑦〉 ∈ ◡𝑅 ↔ 〈𝑥, 𝑦〉 ∈ 𝑅)) |
12 | 11 | eqrelrdv2 4638 | . . 3 ⊢ (((Rel ◡𝑅 ∧ Rel 𝑅) ∧ 𝑅 Er 𝐴) → ◡𝑅 = 𝑅) |
13 | 2, 12 | mpanl1 430 | . 2 ⊢ ((Rel 𝑅 ∧ 𝑅 Er 𝐴) → ◡𝑅 = 𝑅) |
14 | 1, 13 | mpancom 418 | 1 ⊢ (𝑅 Er 𝐴 → ◡𝑅 = 𝑅) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1331 ∈ wcel 1480 〈cop 3530 class class class wbr 3929 ◡ccnv 4538 Rel wrel 4544 Er wer 6426 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-v 2688 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-br 3930 df-opab 3990 df-xp 4545 df-rel 4546 df-cnv 4547 df-er 6429 |
This theorem is referenced by: errn 6451 |
Copyright terms: Public domain | W3C validator |