Theorem rspcedeq1vd 2709

Description: Restricted existential specialization, using implicit substitution. Variant of rspcedvd 2708 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 2089	. 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝐶 = 𝐷 ↔ 𝐷 = 𝐷))
4		eqidd 2082	. 2 ⊢ (𝜑 → 𝐷 = 𝐷)
5	1, 3, 4	rspcedvd 2708	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 𝐶 = 𝐷)

Syntax hints:   → wi 4   ∧ wa 102   = wceq 1284   ∈ wcel 1433  ∃wrex 2349

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-rex 2354  df-v 2603

This theorem is referenced by: (None)