Theorem eqsndOLD 4762

Description: Obsolete version of eqsnd 4761 as of 3-Jul-2025. (Contributed by Thierry Arnoux, 10-May-2023.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
eqsnd.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 = 𝐵)
eqsnd.2	⊢ (𝜑 → 𝐵 ∈ 𝐴)

Assertion

Ref	Expression
eqsndOLD	⊢ (𝜑 → 𝐴 = {𝐵})

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜑,𝑥

Proof of Theorem eqsndOLD

Step	Hyp	Ref	Expression
1		eqsnd.1	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 = 𝐵)
2		simpr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐵) → 𝑥 = 𝐵)
3		eqsnd.2	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝐴)
4	3	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐵) → 𝐵 ∈ 𝐴)
5	2, 4	eqeltrd 2839	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐵) → 𝑥 ∈ 𝐴)
6	1, 5	impbida 806	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 = 𝐵))
7		velsn 4571	. . 3 ⊢ (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵)
8	6, 7	bitr4di 290	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ {𝐵}))
9	8	eqrdv 2737	1 ⊢ (𝜑 → 𝐴 = {𝐵})

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1547   ∈ wcel 2119  {csn 4555

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711

This theorem depends on definitions:  df-bi 208  df-an 397  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-v 3433  df-sn 4556

This theorem is referenced by: (None)