MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rexsn Structured version   Visualization version   GIF version

Theorem rexsn 4255
Description: Restricted existential quantification over a singleton. (Contributed by Jeff Madsen, 5-Jan-2011.)
Hypotheses
Ref Expression
ralsn.1 𝐴 ∈ V
ralsn.2 (𝑥 = 𝐴 → (𝜑𝜓))
Assertion
Ref Expression
rexsn (∃𝑥 ∈ {𝐴}𝜑𝜓)
Distinct variable groups:   𝑥,𝐴   𝜓,𝑥
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rexsn
StepHypRef Expression
1 ralsn.1 . 2 𝐴 ∈ V
2 ralsn.2 . . 3 (𝑥 = 𝐴 → (𝜑𝜓))
32rexsng 4251 . 2 (𝐴 ∈ V → (∃𝑥 ∈ {𝐴}𝜑𝜓))
41, 3ax-mp 5 1 (∃𝑥 ∈ {𝐴}𝜑𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196   = wceq 1523  wcel 2030  wrex 2942  Vcvv 3231  {csn 4210
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-rex 2947  df-v 3233  df-sbc 3469  df-sn 4211
This theorem is referenced by:  elsnres  5471  oarec  7687  snec  7853  zornn0g  9365  fpwwe2lem13  9502  elreal  9990  hashge2el2difr  13301  vdwlem6  15737  pmatcollpw3fi1  20641  restsn  21022  snclseqg  21966  ust0  22070  esum2dlem  30282  eulerpartlemgh  30568  eldm3  31777  poimirlem28  33567  heiborlem3  33742
  Copyright terms: Public domain W3C validator