Theorem rabsneq 4608

Description: Equality of class abstractions restricted to a singleton. (Contributed by AV, 17-May-2025.)

Assertion

Ref	Expression
rabsneq	⊢ (𝑁 ∈ 𝑉 → {𝑥 ∈ {𝑁} ∣ 𝜓} = {𝑥 ∈ 𝑉 ∣ (𝑥 = 𝑁 ∧ 𝜓)})

Distinct variable groups:   𝑥,𝑁   𝑥,𝑉

Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem rabsneq

Step	Hyp	Ref	Expression
1		velsn 4605	. . . . . 6 ⊢ (𝑥 ∈ {𝑁} ↔ 𝑥 = 𝑁)
2		eleq1a 2823	. . . . . . 7 ⊢ (𝑁 ∈ 𝑉 → (𝑥 = 𝑁 → 𝑥 ∈ 𝑉))
3	2	pm4.71rd 562	. . . . . 6 ⊢ (𝑁 ∈ 𝑉 → (𝑥 = 𝑁 ↔ (𝑥 ∈ 𝑉 ∧ 𝑥 = 𝑁)))
4	1, 3	bitrid 283	. . . . 5 ⊢ (𝑁 ∈ 𝑉 → (𝑥 ∈ {𝑁} ↔ (𝑥 ∈ 𝑉 ∧ 𝑥 = 𝑁)))
5	4	anbi1d 631	. . . 4 ⊢ (𝑁 ∈ 𝑉 → ((𝑥 ∈ {𝑁} ∧ 𝜓) ↔ ((𝑥 ∈ 𝑉 ∧ 𝑥 = 𝑁) ∧ 𝜓)))
6		anass 468	. . . 4 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑥 = 𝑁) ∧ 𝜓) ↔ (𝑥 ∈ 𝑉 ∧ (𝑥 = 𝑁 ∧ 𝜓)))
7	5, 6	bitrdi 287	. . 3 ⊢ (𝑁 ∈ 𝑉 → ((𝑥 ∈ {𝑁} ∧ 𝜓) ↔ (𝑥 ∈ 𝑉 ∧ (𝑥 = 𝑁 ∧ 𝜓))))
8	7	abbidv 2795	. 2 ⊢ (𝑁 ∈ 𝑉 → {𝑥 ∣ (𝑥 ∈ {𝑁} ∧ 𝜓)} = {𝑥 ∣ (𝑥 ∈ 𝑉 ∧ (𝑥 = 𝑁 ∧ 𝜓))})
9		df-rab 3406	. 2 ⊢ {𝑥 ∈ {𝑁} ∣ 𝜓} = {𝑥 ∣ (𝑥 ∈ {𝑁} ∧ 𝜓)}
10		df-rab 3406	. 2 ⊢ {𝑥 ∈ 𝑉 ∣ (𝑥 = 𝑁 ∧ 𝜓)} = {𝑥 ∣ (𝑥 ∈ 𝑉 ∧ (𝑥 = 𝑁 ∧ 𝜓))}
11	8, 9, 10	3eqtr4g 2789	1 ⊢ (𝑁 ∈ 𝑉 → {𝑥 ∈ {𝑁} ∣ 𝜓} = {𝑥 ∈ 𝑉 ∣ (𝑥 = 𝑁 ∧ 𝜓)})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  {cab 2707  {crab 3405  {csn 4589

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-rab 3406  df-v 3449  df-sn 4590

This theorem is referenced by:  dfsclnbgr6  47855