Theorem cbv2w 2357

Description: Rule used to change bound variables, using implicit substitution. Version of cbv2 2423 with a disjoint variable condition, which does not require ax-13 2390. (Contributed by NM, 5-Aug-1993.) (Revised by Gino Giotto, 10-Jan-2024.)

Hypotheses

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

Assertion

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

Distinct variable group:   𝑥,𝑦

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

Proof of Theorem cbv2w

Step	Hyp	Ref	Expression
1		cbv2w.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		cbv2w.2	. . 3 ⊢ Ⅎ𝑦𝜑
3		cbv2w.3	. . 3 ⊢ (𝜑 → Ⅎ𝑦𝜓)
4		cbv2w.4	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝜒)
5		cbv2w.5	. . . 4 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))
6		biimp 217	. . . 4 ⊢ ((𝜓 ↔ 𝜒) → (𝜓 → 𝜒))
7	5, 6	syl6 35	. . 3 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 → 𝜒)))
8	1, 2, 3, 4, 7	cbv1v 2356	. 2 ⊢ (𝜑 → (∀𝑥𝜓 → ∀𝑦𝜒))
9		equcomi 2024	. . . 4 ⊢ (𝑦 = 𝑥 → 𝑥 = 𝑦)
10		biimpr 222	. . . 4 ⊢ ((𝜓 ↔ 𝜒) → (𝜒 → 𝜓))
11	9, 5, 10	syl56 36	. . 3 ⊢ (𝜑 → (𝑦 = 𝑥 → (𝜒 → 𝜓)))
12	2, 1, 4, 3, 11	cbv1v 2356	. 2 ⊢ (𝜑 → (∀𝑦𝜒 → ∀𝑥𝜓))
13	8, 12	impbid 214	1 ⊢ (𝜑 → (∀𝑥𝜓 ↔ ∀𝑦𝜒))

Syntax hints:   → wi 4   ↔ wb 208  ∀wal 1535  Ⅎwnf 1784

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-11 2161  ax-12 2177

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1781  df-nf 1785

This theorem is referenced by:  cbvaldw  2358  cbval2v  2363  cbveud  34656