Theorem rabeqsn 4632

Description: Conditions for a restricted class abstraction to be a singleton. (Contributed by AV, 18-Apr-2019.) (Proof shortened by AV, 26-Aug-2022.)

Assertion

Ref	Expression
rabeqsn	⊢ ({𝑥 ∈ 𝑉 ∣ 𝜑} = {𝑋} ↔ ∀𝑥((𝑥 ∈ 𝑉 ∧ 𝜑) ↔ 𝑥 = 𝑋))

Distinct variable group:   𝑥,𝑋

Allowed substitution hints:   𝜑(𝑥)   𝑉(𝑥)

Proof of Theorem rabeqsn

Step	Hyp	Ref	Expression
1		df-rab 3416	. . 3 ⊢ {𝑥 ∈ 𝑉 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝑉 ∧ 𝜑)}
2	1	eqeq1i 2767	. 2 ⊢ ({𝑥 ∈ 𝑉 ∣ 𝜑} = {𝑋} ↔ {𝑥 ∣ (𝑥 ∈ 𝑉 ∧ 𝜑)} = {𝑋})
3		absn 4608	. 2 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝑉 ∧ 𝜑)} = {𝑋} ↔ ∀𝑥((𝑥 ∈ 𝑉 ∧ 𝜑) ↔ 𝑥 = 𝑋))
4	2, 3	bitri 278	1 ⊢ ({𝑥 ∈ 𝑉 ∣ 𝜑} = {𝑋} ↔ ∀𝑥((𝑥 ∈ 𝑉 ∧ 𝜑) ↔ 𝑥 = 𝑋))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 400  ∀wal 1567   = wceq 1569   ∈ wcel 2142  {cab 2740  {crab 3415  {csn 4588

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1572  df-ex 1809  df-nf 1813  df-sb 2096  df-clab 2741  df-cleq 2754  df-rab 3416  df-sn 4589

This theorem is used by:  rabeqsnd  4634  rabsn  4686  made0  28067  umgr2v2enb1  29887  clwwlknon1loop  30460  wlkl0  30729  zarclssn  34272  k0004val0  44908