Theorem cbvexdva 2410

Description: Rule used to change the bound variable in an existential quantifier with implicit substitution. Deduction form. Usage of this theorem is discouraged because it depends on ax-13 2372. Use the weaker cbvexdvaw 2042 if possible. (Contributed by David Moews, 1-May-2017.) (New usage is discouraged.)

Hypothesis

Ref	Expression
cbvaldva.1	⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
cbvexdva	⊢ (𝜑 → (∃𝑥𝜓 ↔ ∃𝑦𝜒))

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

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

Proof of Theorem cbvexdva

Step	Hyp	Ref	Expression
1		nfv 1917	. 2 ⊢ Ⅎ𝑦𝜑
2		nfvd 1918	. 2 ⊢ (𝜑 → Ⅎ𝑦𝜓)
3		cbvaldva.1	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒))
4	3	ex 413	. 2 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))
5	1, 2, 4	cbvexd 2408	1 ⊢ (𝜑 → (∃𝑥𝜓 ↔ ∃𝑦𝜒))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396  ∃wex 1782

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-11 2154  ax-12 2171  ax-13 2372

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-ex 1783  df-nf 1787

This theorem is referenced by:  cbvex2vv  2414