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

Theorem rexsns 3633
Description: Restricted existential quantification over a singleton. (Contributed by Mario Carneiro, 23-Apr-2015.) (Revised by NM, 22-Aug-2018.)
Assertion
Ref Expression
rexsns  |-  ( E. x  e.  { A } ph  <->  [. A  /  x ]. ph )
Distinct variable group:    x, A
Allowed substitution hint:    ph( x)

Proof of Theorem rexsns
StepHypRef Expression
1 velsn 3611 . . . 4  |-  ( x  e.  { A }  <->  x  =  A )
21anbi1i 458 . . 3  |-  ( ( x  e.  { A }  /\  ph )  <->  ( x  =  A  /\  ph )
)
32exbii 1605 . 2  |-  ( E. x ( x  e. 
{ A }  /\  ph )  <->  E. x ( x  =  A  /\  ph ) )
4 df-rex 2461 . 2  |-  ( E. x  e.  { A } ph  <->  E. x ( x  e.  { A }  /\  ph ) )
5 sbc5 2988 . 2  |-  ( [. A  /  x ]. ph  <->  E. x
( x  =  A  /\  ph ) )
63, 4, 53bitr4i 212 1  |-  ( E. x  e.  { A } ph  <->  [. A  /  x ]. ph )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1353   E.wex 1492    e. wcel 2148   E.wrex 2456   [.wsbc 2964   {csn 3594
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461  df-v 2741  df-sbc 2965  df-sn 3600
This theorem is referenced by:  rexsng  3635  r19.12sn  3660  iunxsngf  3966  finexdc  6904  exfzdc  10242
  Copyright terms: Public domain W3C validator