Theorem rabeqsn 4628

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

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2147  {cab 2741  {crab 3416  {csn 4588

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-rab 3417  df-sn 4589

This theorem is used by:  rabeqsnd  4630  rabsn  4682  made0  28279  umgr2v2enb1  30137  clwwlknon1loop  30719  wlkl0  30998  zarclssn  34575  k0004val0  45346