Theorem cbvrmov 3410

Description: Change the bound variable of a restricted at-most-one quantifier using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2404. (Contributed by Alexander van der Vekens, 17-Jun-2017.) (New usage is discouraged.)

Hypothesis

Ref	Expression
cbvrmov.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbvrmov	⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑦 ∈ 𝐴 𝜓)

Distinct variable groups:   𝑥,𝐴   𝑦,𝐴   𝜑,𝑦   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem cbvrmov

Step	Hyp	Ref	Expression
1		nfv 1944	. 2 ⊢ Ⅎ𝑦𝜑
2		nfv 1944	. 2 ⊢ Ⅎ𝑥𝜓
3		cbvrmov.1	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
4	1, 2, 3	cbvrmo 3409	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑦 ∈ 𝐴 𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∃*wrmo 3368

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-10 2176  ax-11 2192  ax-12 2213  ax-13 2404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370

This theorem is used by: (None)