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

Theorem reusn 3654
Description: A way to express restricted existential uniqueness of a wff: its restricted class abstraction is a singleton. (Contributed by NM, 30-May-2006.) (Proof shortened by Mario Carneiro, 14-Nov-2016.)
Assertion
Ref Expression
reusn  |-  ( E! x  e.  A  ph  <->  E. y { x  e.  A  |  ph }  =  { y } )
Distinct variable groups:    x, y    ph, y    y, A
Allowed substitution hints:    ph( x)    A( x)

Proof of Theorem reusn
StepHypRef Expression
1 euabsn2 3652 . 2  |-  ( E! x ( x  e.  A  /\  ph )  <->  E. y { x  |  ( x  e.  A  /\  ph ) }  =  { y } )
2 df-reu 2455 . 2  |-  ( E! x  e.  A  ph  <->  E! x ( x  e.  A  /\  ph )
)
3 df-rab 2457 . . . 4  |-  { x  e.  A  |  ph }  =  { x  |  ( x  e.  A  /\  ph ) }
43eqeq1i 2178 . . 3  |-  ( { x  e.  A  |  ph }  =  { y }  <->  { x  |  ( x  e.  A  /\  ph ) }  =  {
y } )
54exbii 1598 . 2  |-  ( E. y { x  e.  A  |  ph }  =  { y }  <->  E. y { x  |  (
x  e.  A  /\  ph ) }  =  {
y } )
61, 2, 53bitr4i 211 1  |-  ( E! x  e.  A  ph  <->  E. y { x  e.  A  |  ph }  =  { y } )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1348   E.wex 1485   E!weu 2019    e. wcel 2141   {cab 2156   E!wreu 2450   {crab 2452   {csn 3583
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-reu 2455  df-rab 2457  df-v 2732  df-sn 3589
This theorem is referenced by:  reuen1  6779
  Copyright terms: Public domain W3C validator