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

Theorem ralsn 3567
 Description: Convert a quantification over a singleton to a substitution. (Contributed by NM, 27-Apr-2009.)
Hypotheses
Ref Expression
ralsn.1 𝐴 ∈ V
ralsn.2 (𝑥 = 𝐴 → (𝜑𝜓))
Assertion
Ref Expression
ralsn (∀𝑥 ∈ {𝐴}𝜑𝜓)
Distinct variable groups:   𝑥,𝐴   𝜓,𝑥
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem ralsn
StepHypRef Expression
1 ralsn.1 . 2 𝐴 ∈ V
2 ralsn.2 . . 3 (𝑥 = 𝐴 → (𝜑𝜓))
32ralsng 3564 . 2 (𝐴 ∈ V → (∀𝑥 ∈ {𝐴}𝜑𝜓))
41, 3ax-mp 5 1 (∀𝑥 ∈ {𝐴}𝜑𝜓)
 Colors of variables: wff set class Syntax hints:   → wi 4   ↔ wb 104   = wceq 1331   ∈ wcel 1480  ∀wral 2416  Vcvv 2686  {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-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-v 2688  df-sbc 2910  df-sn 3533 This theorem is referenced by:  tfr0dm  6219  elixpsn  6629  finomni  7012  nninfsellemdc  13236
 Copyright terms: Public domain W3C validator