Theorem ralsn 3752

Description: Convert a quantification over a singleton to a substitution. (Contributed by NM, 27-Apr-2009.)

Hypotheses

Ref	Expression
ralsn.1	|- A e. _V
ralsn.2	|- ( x = A -> ( ph <-> ps ) )

Assertion

Ref	Expression
ralsn	|- ( A. x e. { A } ph <-> ps )

Distinct variable groups:   x, A   ps, x

Allowed substitution hint:   ph( x)

Proof of Theorem ralsn

Step	Hyp	Ref	Expression
1		ralsn.1	. 2 |- A e. _V
2		ralsn.2	. . 3 |- ( x = A -> ( ph <-> ps ) )
3	2	ralsng 3749	. 2 |- ( A e. _V -> ( A. x e. { A } ph <-> ps ) )
4	1, 3	ax-mp 5	1 |- ( A. x e. { A } ph <-> ps )

This proof depends on syntax axioms:   -> wi 4   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   _Vcvv 2821   {csn 3709

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-sbc 3052  df-sn 3715

This theorem is used by:  tfr0dm  6593  elixpsn  7017  finomni  7480  hashfibc  11283  hashf1lem1  11285  eqs1  11396  wlkl1loop  16599  clwwlkn2  16662  nninfsellemdc  17053