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

Theorem exsnrex 3566
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 2689 . . . . . 6  |-  x  e. 
_V
21snid 3556 . . . . 5  |-  x  e. 
{ x }
3 eleq2 2203 . . . . 5  |-  ( M  =  { x }  ->  ( x  e.  M  <->  x  e.  { x }
) )
42, 3mpbiri 167 . . . 4  |-  ( M  =  { x }  ->  x  e.  M )
54pm4.71ri 389 . . 3  |-  ( M  =  { x }  <->  ( x  e.  M  /\  M  =  { x } ) )
65exbii 1584 . 2  |-  ( E. x  M  =  {
x }  <->  E. x
( x  e.  M  /\  M  =  {
x } ) )
7 df-rex 2422 . 2  |-  ( E. x  e.  M  M  =  { x }  <->  E. x
( x  e.  M  /\  M  =  {
x } ) )
86, 7bitr4i 186 1  |-  ( E. x  M  =  {
x }  <->  E. x  e.  M  M  =  { x } )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1331   E.wex 1468    e. wcel 1480   E.wrex 2417   {csn 3527
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-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-rex 2422  df-v 2688  df-sn 3533
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator