MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  epin Structured version   Visualization version   GIF version

Theorem epin 6111
Description: Any set is equal to its preimage under the converse membership relation. (Contributed by Mario Carneiro, 9-Mar-2013.) Put in closed form. (Revised by BJ, 16-Oct-2024.)
Assertion
Ref Expression
epin (𝐴 ∈ 𝑉 → (◡ E “ {𝐴}) = 𝐴)

Proof of Theorem epin
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 vex 3458 . . . 4 𝑥 ∈ V
21eliniseg 6110 . . 3 (𝐴 ∈ 𝑉 → (𝑥 ∈ (◡ E “ {𝐴}) ↔ 𝑥 E 𝐴))
3 epelg 5559 . . 3 (𝐴 ∈ 𝑉 → (𝑥 E 𝐴 ↔ 𝑥 ∈ 𝐴))
42, 3bitrd 282 . 2 (𝐴 ∈ 𝑉 → (𝑥 ∈ (◡ E “ {𝐴}) ↔ 𝑥 ∈ 𝐴))
54eqrdv 2761 1 (𝐴 ∈ 𝑉 → (◡ E “ {𝐴}) = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {csn 4588   class class class wbr 5108   E cep 5557  ◡ccnv 5657   “ cima 5661
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-eprel 5558  df-xp 5664  df-cnv 5666  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671
This theorem is used by:  epini  6112
  Copyright terms: Public domain W3C validator