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

Theorem issetid 5840
Description: Two ways of expressing set existence. (Contributed by NM, 16-Feb-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) (Revised by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
issetid (𝐴 ∈ V ↔ 𝐴 I 𝐴)

Proof of Theorem issetid
StepHypRef Expression
1 ididg 5839 . 2 (𝐴 ∈ V → 𝐴 I 𝐴)
2 reli 5813 . . 3 Rel I
32brrelex1i 5717 . 2 (𝐴 I 𝐴𝐴 ∈ V)
41, 3impbii 212 1 (𝐴 ∈ V ↔ 𝐴 I 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 209  wcel 2143  Vcvv 3455   class class class wbr 5109   I cid 5555
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-id 5556  df-xp 5667  df-rel 5668
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator