Theorem rspcedeq1vd 2865

Description: Restricted existential specialization, using implicit substitution. Variant of rspcedvd 2862 for equations, in which the left hand side depends on the quantified variable. (Contributed by AV, 24-Dec-2019.)

Hypotheses

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

Assertion

Ref	Expression
rspcedeq1vd	⊢ (𝜑 → ∃𝑥 ∈ 𝐵 𝐶 = 𝐷)

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

Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem rspcedeq1vd

Step	Hyp	Ref	Expression
1		rspcedeqvd.1	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
2		rspcedeqvd.2	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐶 = 𝐷)
3	2	eqeq1d 2198	. 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝐶 = 𝐷 ↔ 𝐷 = 𝐷))
4		eqidd 2190	. 2 ⊢ (𝜑 → 𝐷 = 𝐷)
5	1, 3, 4	rspcedvd 2862	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 𝐶 = 𝐷)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2160  ∃wrex 2469

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-rex 2474  df-v 2754

This theorem is referenced by: (None)