Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  rexsng Unicode version

Theorem rexsng 3686
 Description: Restricted existential quantification over a singleton. (Contributed by NM, 29-Jan-2012.)
Hypothesis
Ref Expression
ralsng.1
Assertion
Ref Expression
rexsng
Distinct variable groups:   ,   ,
Allowed substitution hints:   ()   ()

Proof of Theorem rexsng
StepHypRef Expression
1 rexsns 3684 . 2
2 ralsng.1 . . 3
32sbcieg 3036 . 2
41, 3bitrd 244 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 176   wceq 1632   wcel 1696  wrex 2557  wsbc 3004  csn 3653 This theorem is referenced by:  rexsn  3688  rexprg  3696  rextpg  3698  iunxsng  3996  frirr  4386  frsn  4776  imasng  5051  ballotlemfc0  23067  ballotlemfcc  23068  nZdef  25283  prsubrtr  25502  isconcl7a  26208  frgra2v  28423  1vwmgra  28427  elpaddat  30615  elpadd2at  30617 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-rex 2562  df-v 2803  df-sbc 3005  df-sn 3659
 Copyright terms: Public domain W3C validator