Theorem cbvaldva 2438

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

Hypothesis

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

Assertion

Ref	Expression
cbvaldva	⊢ (𝜑 → (∀𝑥𝜓 ↔ ∀𝑦𝜒))

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

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

Proof of Theorem cbvaldva

Step	Hyp	Ref	Expression
1		nfv 1946	. 2 ⊢ Ⅎ𝑦𝜑
2		nfvd 1947	. 2 ⊢ (𝜑 → Ⅎ𝑦𝜓)
3		cbvaldva.1	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒))
4	3	ex 418	. 2 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))
5	1, 2, 4	cbvald 2436	1 ⊢ (𝜑 → (∀𝑥𝜓 ↔ ∀𝑦𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567

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-11 2193  ax-12 2212  ax-13 2401

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816

This theorem is used by:  cbval2vv  2442