Theorem rabeqsn 4627

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 3413	. . 3 ⊢ {𝑥 ∈ 𝑉 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝑉 ∧ 𝜑)}
2	1	eqeq1i 2765	. 2 ⊢ ({𝑥 ∈ 𝑉 ∣ 𝜑} = {𝑋} ↔ {𝑥 ∣ (𝑥 ∈ 𝑉 ∧ 𝜑)} = {𝑋})
3		absn 4603	. 2 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝑉 ∧ 𝜑)} = {𝑋} ↔ ∀𝑥((𝑥 ∈ 𝑉 ∧ 𝜑) ↔ 𝑥 = 𝑋))
4	2, 3	bitri 278	1 ⊢ ({𝑥 ∈ 𝑉 ∣ 𝜑} = {𝑋} ↔ ∀𝑥((𝑥 ∈ 𝑉 ∧ 𝜑) ↔ 𝑥 = 𝑋))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569   ∈ wcel 2144  {cab 2738  {crab 3412  {csn 4583

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-rab 3413  df-sn 4584

This theorem is used by:  rabeqsnd  4629  rabsn  4681  made0  28250  umgr2v2enb1  30108  clwwlknon1loop  30690  wlkl0  30969  zarclssn  34548  k0004val0  45230