Theorem cbv1v 2333

Description: Rule used to change bound variables, using implicit substitution. Version of cbv1 2402 with a disjoint variable condition, which does not require ax-13 2372. (Contributed by NM, 5-Aug-1993.) (Revised by BJ, 16-Jun-2019.)

Hypotheses

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

Assertion

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

Distinct variable group:   𝑥,𝑦

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

Proof of Theorem cbv1v

Step	Hyp	Ref	Expression
1		cbv1v.2	. . . . 5 ⊢ Ⅎ𝑦𝜑
2		cbv1v.3	. . . . 5 ⊢ (𝜑 → Ⅎ𝑦𝜓)
3	1, 2	nfim1 2192	. . . 4 ⊢ Ⅎ𝑦(𝜑 → 𝜓)
4		cbv1v.1	. . . . 5 ⊢ Ⅎ𝑥𝜑
5		cbv1v.4	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜒)
6	4, 5	nfim1 2192	. . . 4 ⊢ Ⅎ𝑥(𝜑 → 𝜒)
7		cbv1v.5	. . . . . 6 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 → 𝜒)))
8	7	com12 32	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 → (𝜓 → 𝜒)))
9	8	a2d 29	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝜑 → 𝜓) → (𝜑 → 𝜒)))
10	3, 6, 9	cbv3v 2332	. . 3 ⊢ (∀𝑥(𝜑 → 𝜓) → ∀𝑦(𝜑 → 𝜒))
11	4	19.21 2200	. . 3 ⊢ (∀𝑥(𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥𝜓))
12	1	19.21 2200	. . 3 ⊢ (∀𝑦(𝜑 → 𝜒) ↔ (𝜑 → ∀𝑦𝜒))
13	10, 11, 12	3imtr3i 291	. 2 ⊢ ((𝜑 → ∀𝑥𝜓) → (𝜑 → ∀𝑦𝜒))
14	13	pm2.86i 110	1 ⊢ (𝜑 → (∀𝑥𝜓 → ∀𝑦𝜒))

Syntax hints:   → wi 4  ∀wal 1537  Ⅎwnf 1786

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-11 2154  ax-12 2171

This theorem depends on definitions:  df-bi 206  df-or 845  df-ex 1783  df-nf 1787

This theorem is referenced by:  cbv2w  2334  vtoclgft  3492  bj-cbv1hv  34978