Theorem rabsn 4682

Description: Condition where a restricted class abstraction is a singleton. (Contributed by NM, 28-May-2006.) (Proof shortened by AV, 26-Aug-2022.)

Assertion

Ref	Expression
rabsn	⊢ (𝐵 ∈ 𝐴 → {𝑥 ∈ 𝐴 ∣ 𝑥 = 𝐵} = {𝐵})

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem rabsn

Step	Hyp	Ref	Expression
1		eleq1 2849	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
2	1	pm5.32ri 586	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐵) ↔ (𝐵 ∈ 𝐴 ∧ 𝑥 = 𝐵))
3	2	baib 545	. . 3 ⊢ (𝐵 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐵) ↔ 𝑥 = 𝐵))
4	3	alrimiv 1960	. 2 ⊢ (𝐵 ∈ 𝐴 → ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐵) ↔ 𝑥 = 𝐵))
5		rabeqsn 4628	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝑥 = 𝐵} = {𝐵} ↔ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐵) ↔ 𝑥 = 𝐵))
6	4, 5	sylibr 237	1 ⊢ (𝐵 ∈ 𝐴 → {𝑥 ∈ 𝐴 ∣ 𝑥 = 𝐵} = {𝐵})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145  {crab 3413  {csn 4584

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-sn 4585

This theorem is used by:  unisn3  4888  sylow3lem6  19826  fineqvnttrclse  35765  lineunray  36882  pmapat  40788  dia0  42077  nzss  45260  lco0  49483