Theorem rspcedeqvd 3583

Description: Restricted existential specialization, using implicit substitution. Variant of rspcedvd 3578 for equations. (Contributed by AV, 24-Dec-2019.)

Hypotheses

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

Assertion

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

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

Allowed substitution hints:   𝐶(𝑥)   𝐷(𝑥)

Proof of Theorem rspcedeqvd

Step	Hyp	Ref	Expression
1		rspcedeqvd.2	. 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐶 = 𝐷)
2		rspcedeqvd.1	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
3	1, 2	rspcime 3581	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 𝐶 = 𝐷)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087

This theorem is used by:  elpr2elpr  4828  fsetfocdm  8883  mod2eq1n2dvds  16517  symgextfo  19636  fincygsubgodexd  20329  smatvscl  22839  eucrctshift  30844  fsuppcurry1  33316  fsuppcurry2  33317  nnn1suc  43332  fimgmcyc  43599  ntrclsneine0lem  45064  mogoldbblem  48818  sbgoldbwt  48875  sbgoldbo  48885