ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  issetid Unicode version

Theorem issetid 4688
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  |-  ( A  e.  _V  <->  A  _I  A )

Proof of Theorem issetid
StepHypRef Expression
1 ididg 4687 . 2  |-  ( A  e.  _V  ->  A  _I  A )
2 reli 4663 . . 3  |-  Rel  _I
32brrelex1i 4577 . 2  |-  ( A  _I  A  ->  A  e.  _V )
41, 3impbii 125 1  |-  ( A  e.  _V  <->  A  _I  A )
Colors of variables: wff set class
Syntax hints:    <-> wb 104    e. wcel 1480   _Vcvv 2681   class class class wbr 3924    _I cid 4205
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-opab 3985  df-id 4210  df-xp 4540  df-rel 4541
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator