Theorem cbvaldvaw 2070

Description: Rule used to change the bound variable in a universal quantifier with implicit substitution. Deduction form. Version of cbvaldva 2438 with a disjoint variable condition, requiring fewer axioms. (Contributed by David Moews, 1-May-2017.) Avoid ax-13 2401. (Revised by GG, 10-Jan-2024.) Reduce axiom usage, along an idea of GG. (Revised by Wolf Lammen, 10-Feb-2024.)

Hypothesis

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

Assertion

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

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

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

Proof of Theorem cbvaldvaw

Step	Hyp	Ref	Expression
1		cbvaldvaw.1	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒))
2	1	ancoms 464	. . . . 5 ⊢ ((𝑥 = 𝑦 ∧ 𝜑) → (𝜓 ↔ 𝜒))
3	2	pm5.74da 816	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜒)))
4	3	cbvalvw 2068	. . 3 ⊢ (∀𝑥(𝜑 → 𝜓) ↔ ∀𝑦(𝜑 → 𝜒))
5		19.21v 1971	. . 3 ⊢ (∀𝑥(𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥𝜓))
6		19.21v 1971	. . 3 ⊢ (∀𝑦(𝜑 → 𝜒) ↔ (𝜑 → ∀𝑦𝜒))
7	4, 5, 6	3bitr3i 304	. 2 ⊢ ((𝜑 → ∀𝑥𝜓) ↔ (𝜑 → ∀𝑦𝜒))
8	7	pm5.74ri 275	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

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812

This theorem is used by:  cbvexdvaw  2071  cbval2vw  2072  cbvraldva2  3336  scottabf  9944  cbvmodavw  37133  cbvsbdavw  37137  cbvsbdavw2  37138  findcard4  38739  ismnu  45352