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

Theorem rexsns 3563
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 3544 . . . 4  |-  ( x  e.  { A }  <->  x  =  A )
21anbi1i 453 . . 3  |-  ( ( x  e.  { A }  /\  ph )  <->  ( x  =  A  /\  ph )
)
32exbii 1584 . 2  |-  ( E. x ( x  e. 
{ A }  /\  ph )  <->  E. x ( x  =  A  /\  ph ) )
4 df-rex 2422 . 2  |-  ( E. x  e.  { A } ph  <->  E. x ( x  e.  { A }  /\  ph ) )
5 sbc5 2932 . 2  |-  ( [. A  /  x ]. ph  <->  E. x
( x  =  A  /\  ph ) )
63, 4, 53bitr4i 211 1  |-  ( E. x  e.  { A } ph  <->  [. A  /  x ]. ph )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1331   E.wex 1468    e. wcel 1480   E.wrex 2417   [.wsbc 2909   {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-sbc 2910  df-sn 3533
This theorem is referenced by:  rexsng  3565  r19.12sn  3589  iunxsngf  3890  finexdc  6796  exfzdc  10017
  Copyright terms: Public domain W3C validator