Theorem ecidg 6768

Description: A set is equal to its converse epsilon coset. (Note: converse epsilon is not an equivalence relation.) (Contributed by Jim Kingdon, 8-Jan-2020.)

Assertion

Ref	Expression
ecidg	⊢ (𝐴 ∈ 𝑉 → [𝐴]◡ E = 𝐴)

Proof of Theorem ecidg

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 2805	. . . 4 ⊢ 𝑦 ∈ V
2		elecg 6742	. . . 4 ⊢ ((𝑦 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝑦 ∈ [𝐴]◡ E ↔ 𝐴◡ E 𝑦))
3	1, 2	mpan 424	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑦 ∈ [𝐴]◡ E ↔ 𝐴◡ E 𝑦))
4		brcnvg 4911	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑦 ∈ V) → (𝐴◡ E 𝑦 ↔ 𝑦 E 𝐴))
5	1, 4	mpan2 425	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴◡ E 𝑦 ↔ 𝑦 E 𝐴))
6		epelg 4387	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑦 E 𝐴 ↔ 𝑦 ∈ 𝐴))
7	3, 5, 6	3bitrd 214	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝑦 ∈ [𝐴]◡ E ↔ 𝑦 ∈ 𝐴))
8	7	eqrdv 2229	1 ⊢ (𝐴 ∈ 𝑉 → [𝐴]◡ E = 𝐴)

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1397   ∈ wcel 2202  Vcvv 2802   class class class wbr 4088   E cep 4384  ^◡ccnv 4724  [cec 6700

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-eprel 4386  df-xp 4731  df-cnv 4733  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-ec 6704

This theorem is referenced by:  addcnsrec  8062  mulcnsrec  8063