| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: A set is equal to its converse epsilon coset. (Note: converse epsilon is not an equivalence relation.) |
| Ref | Expression |
|---|---|
| ecid.1 | ⊢ A ∈ V |
| Ref | Expression |
|---|---|
| ecid | ⊢ [A]◡E = A |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ecid.1 | . . 3 ⊢ A ∈ V | |
| 2 | 1 | ec2 3203 | . 2 ⊢ [A]◡E = {y∣A◡Ey} |
| 3 | visset 1350 | . . . . 5 ⊢ y ∈ V | |
| 4 | 1, 3 | brcnv 2519 | . . . 4 ⊢ (A◡Ey ↔ yEA) |
| 5 | 3, 1 | epelc 2123 | . . . 4 ⊢ (yEA ↔ y ∈ A) |
| 6 | 4, 5 | bitr 151 | . . 3 ⊢ (A◡Ey ↔ y ∈ A) |
| 7 | 6 | biabi 1181 | . 2 ⊢ {y∣A◡Ey} = {y∣y ∈ A} |
| 8 | abid2 1186 | . 2 ⊢ {y∣y ∈ A} = A | |
| 9 | 2, 7, 8 | 3eqtr 1123 | 1 ⊢ [A]◡E = A |
| Colors of variables: wff set class |
| Syntax hints: {cab 1090 = wceq 1091 ∈ wcel 1092 Vcvv 1348 class class class wbr 2054 Ecep 2056 ◡ccnv 2409 [cec 3198 |
| This theorem is referenced by: qsid 3237 addcnsrec 4057 mulcnsrec 4058 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-pow 1077 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-rex 1206 df-v 1349 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-nul 1708 df-pw 1799 df-sn 1811 df-pr 1812 df-op 1815 df-br 2063 df-opab 2098 df-eprel 2122 df-xp 2424 df-cnv 2426 df-dm 2428 df-rn 2429 df-res 2430 df-ima 2431 df-ec 3202 |