Theorem cbv3v 2370

Description: Rule used to change bound variables, using implicit substitution. Version of cbv3 2432 with a disjoint variable condition, which does not require ax-13 2407. (Contributed by NM, 5-Aug-1993.) (Revised by BJ, 31-May-2019.)

Hypotheses

Ref	Expression
cbv3v.nf1	⊢ Ⅎ𝑦𝜑
cbv3v.nf2	⊢ Ⅎ𝑥𝜓
cbv3v.1	⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓))

Assertion

Ref	Expression
cbv3v	⊢ (∀𝑥𝜑 → ∀𝑦𝜓)

Distinct variable group:   𝑥,𝑦

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

Proof of Theorem cbv3v

Step	Hyp	Ref	Expression
1		cbv3v.nf1	. . . 4 ⊢ Ⅎ𝑦𝜑
2	1	nf5ri 2234	. . 3 ⊢ (𝜑 → ∀𝑦𝜑)
3	2	hbal 2205	. 2 ⊢ (∀𝑥𝜑 → ∀𝑦∀𝑥𝜑)
4		cbv3v.nf2	. . 3 ⊢ Ⅎ𝑥𝜓
5		cbv3v.1	. . 3 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓))
6	4, 5	spimfv 2278	. 2 ⊢ (∀𝑥𝜑 → 𝜓)
7	3, 6	alrimih 1857	1 ⊢ (∀𝑥𝜑 → ∀𝑦𝜓)

This proof depends on syntax axioms:   → wi 4  ∀wal 1568  Ⅎwnf 1816

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-11 2195  ax-12 2216

This proof depends on definitions:  df-bi 210  df-ex 1813  df-nf 1817

This theorem is used by:  cbv1v  2371  cbv3hv  2375  cbvalv1  2376