Theorem rexsns 4217

Description: Restricted existential quantification over a singleton. (Contributed by Mario Carneiro, 23-Apr-2015.) (Revised by NM, 22-Aug-2018.)

Assertion

Ref	Expression
rexsns	⊢ (∃𝑥 ∈ {𝐴}𝜑 ↔ [𝐴 / 𝑥]𝜑)

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rexsns

Step	Hyp	Ref	Expression
1		velsn 4193	. . . 4 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
2	1	anbi1i 731	. . 3 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ 𝜑))
3	2	exbii 1774	. 2 ⊢ (∃𝑥(𝑥 ∈ {𝐴} ∧ 𝜑) ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝜑))
4		df-rex 2918	. 2 ⊢ (∃𝑥 ∈ {𝐴}𝜑 ↔ ∃𝑥(𝑥 ∈ {𝐴} ∧ 𝜑))
5		sbc5 3460	. 2 ⊢ ([𝐴 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝜑))
6	3, 4, 5	3bitr4i 292	1 ⊢ (∃𝑥 ∈ {𝐴}𝜑 ↔ [𝐴 / 𝑥]𝜑)

Syntax hints:   ↔ wb 196   ∧ wa 384   = wceq 1483  ∃wex 1704   ∈ wcel 1990  ∃wrex 2913  [wsbc 3435  {csn 4177

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-v 3202  df-sbc 3436  df-sn 4178

This theorem is referenced by:  rexsng  4219  r19.12sn  4255  iunxsngf  29375  poimirlem25  33434  rexsngf  39220