Theorem cbv2 2401

Description: Rule used to change bound variables, using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2370. See cbv2w 2332 with disjoint variable conditions, not depending on ax-13 2370. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Oct-2016.) Format hypotheses to common style, avoid ax-10 2135. (Revised by Wolf Lammen, 10-Sep-2023.) (New usage is discouraged.)

Hypotheses

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

Assertion

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

Proof of Theorem cbv2

Step	Hyp	Ref	Expression
1		cbv2.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		cbv2.2	. . 3 ⊢ Ⅎ𝑦𝜑
3		cbv2.3	. . 3 ⊢ (𝜑 → Ⅎ𝑦𝜓)
4		cbv2.4	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝜒)
5		cbv2.5	. . . 4 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))
6		biimp 214	. . . 4 ⊢ ((𝜓 ↔ 𝜒) → (𝜓 → 𝜒))
7	5, 6	syl6 35	. . 3 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 → 𝜒)))
8	1, 2, 3, 4, 7	cbv1 2400	. 2 ⊢ (𝜑 → (∀𝑥𝜓 → ∀𝑦𝜒))
9		equcomi 2018	. . . 4 ⊢ (𝑦 = 𝑥 → 𝑥 = 𝑦)
10		biimpr 219	. . . 4 ⊢ ((𝜓 ↔ 𝜒) → (𝜒 → 𝜓))
11	9, 5, 10	syl56 36	. . 3 ⊢ (𝜑 → (𝑦 = 𝑥 → (𝜒 → 𝜓)))
12	2, 1, 4, 3, 11	cbv1 2400	. 2 ⊢ (𝜑 → (∀𝑦𝜒 → ∀𝑥𝜓))
13	8, 12	impbid 211	1 ⊢ (𝜑 → (∀𝑥𝜓 ↔ ∀𝑦𝜒))

Syntax hints:   → wi 4   ↔ wb 205  ∀wal 1537  Ⅎwnf 1783

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-11 2152  ax-12 2169  ax-13 2370

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-ex 1780  df-nf 1784

This theorem is referenced by:  cbvald  2405  cbval2  2409  sb9  2521  wl-cbvalnaed  35739  wl-sb8t  35755