Theorem ecidg 6658

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 2766	. . . 4 ⊢ 𝑦 ∈ V
2		elecg 6632	. . . 4 ⊢ ((𝑦 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝑦 ∈ [𝐴]◡ E ↔ 𝐴◡ E 𝑦))
3	1, 2	mpan 424	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑦 ∈ [𝐴]◡ E ↔ 𝐴◡ E 𝑦))
4		brcnvg 4847	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑦 ∈ V) → (𝐴◡ E 𝑦 ↔ 𝑦 E 𝐴))
5	1, 4	mpan2 425	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴◡ E 𝑦 ↔ 𝑦 E 𝐴))
6		epelg 4325	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑦 E 𝐴 ↔ 𝑦 ∈ 𝐴))
7	3, 5, 6	3bitrd 214	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝑦 ∈ [𝐴]◡ E ↔ 𝑦 ∈ 𝐴))
8	7	eqrdv 2194	1 ⊢ (𝐴 ∈ 𝑉 → [𝐴]◡ E = 𝐴)

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1364   ∈ wcel 2167  Vcvv 2763   class class class wbr 4033   E cep 4322  ^◡ccnv 4662  [cec 6590

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-eprel 4324  df-xp 4669  df-cnv 4671  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-ec 6594

This theorem is referenced by:  addcnsrec  7909  mulcnsrec  7910