Theorem cbvaldw 2367

Description: Deduction used to change bound variables, using implicit substitution. Version of cbvald 2436 with a disjoint variable condition, which does not require ax-13 2401. (Contributed by NM, 2-Jan-2002.) Avoid ax-13 2401. (Revised by GG, 10-Jan-2024.)

Hypotheses

Ref	Expression
cbvaldw.1	⊢ Ⅎ𝑦𝜑
cbvaldw.2	⊢ (𝜑 → Ⅎ𝑦𝜓)
cbvaldw.3	⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))

Assertion

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

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

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

Proof of Theorem cbvaldw

Step	Hyp	Ref	Expression
1		nfv 1946	. 2 ⊢ Ⅎ𝑥𝜑
2		cbvaldw.1	. 2 ⊢ Ⅎ𝑦𝜑
3		cbvaldw.2	. 2 ⊢ (𝜑 → Ⅎ𝑦𝜓)
4		nfvd 1947	. 2 ⊢ (𝜑 → Ⅎ𝑥𝜒)
5		cbvaldw.3	. 2 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))
6	1, 2, 3, 4, 5	cbv2w 2366	1 ⊢ (𝜑 → (∀𝑥𝜓 ↔ ∀𝑦𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567  Ⅎwnf 1815

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

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:  cbvexdw  2368  axtcond  37266  mh-setindnd  37325  wl-sb8eutv  38512