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

Theorem exsnrex 3747
Description: There is a set being the element of a singleton if and only if there is an element of the singleton. (Contributed by Alexander van der Vekens, 1-Jan-2018.)
Assertion
Ref Expression
exsnrex  |-  ( E. x  M  =  {
x }  <->  E. x  e.  M  M  =  { x } )

Proof of Theorem exsnrex
StepHypRef Expression
1 vex 2824 . . . . . 6  |-  x  e. 
_V
21snid 3736 . . . . 5  |-  x  e. 
{ x }
3 eleq2 2302 . . . . 5  |-  ( M  =  { x }  ->  ( x  e.  M  <->  x  e.  { x }
) )
42, 3mpbiri 168 . . . 4  |-  ( M  =  { x }  ->  x  e.  M )
54pm4.71ri 396 . . 3  |-  ( M  =  { x }  <->  ( x  e.  M  /\  M  =  { x } ) )
65exbii 1658 . 2  |-  ( E. x  M  =  {
x }  <->  E. x
( x  e.  M  /\  M  =  {
x } ) )
7 df-rex 2534 . 2  |-  ( E. x  e.  M  M  =  { x }  <->  E. x
( x  e.  M  /\  M  =  {
x } ) )
86, 7bitr4i 187 1  |-  ( E. x  M  =  {
x }  <->  E. x  e.  M  M  =  { x } )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1402   E.wex 1545    e. wcel 2209   E.wrex 2529   {csn 3705
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-sn 3711
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator