Theorem cbv1h 1633

Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 13-May-2018.)

Hypotheses

Ref	Expression
cbv1h.1	⊢ (𝜑 → (𝜓 → ∀𝑦𝜓))
cbv1h.2	⊢ (𝜑 → (𝜒 → ∀𝑥𝜒))
cbv1h.3	⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 → 𝜒)))

Assertion

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

Proof of Theorem cbv1h

Step	Hyp	Ref	Expression
1		nfa1 1434	. 2 ⊢ Ⅎ𝑥∀𝑥∀𝑦𝜑
2		nfa2 1471	. 2 ⊢ Ⅎ𝑦∀𝑥∀𝑦𝜑
3		sp 1401	. . . . 5 ⊢ (∀𝑦𝜑 → 𝜑)
4	3	sps 1430	. . . 4 ⊢ (∀𝑥∀𝑦𝜑 → 𝜑)
5		cbv1h.1	. . . 4 ⊢ (𝜑 → (𝜓 → ∀𝑦𝜓))
6	4, 5	syl 14	. . 3 ⊢ (∀𝑥∀𝑦𝜑 → (𝜓 → ∀𝑦𝜓))
7	2, 6	nfd 1416	. 2 ⊢ (∀𝑥∀𝑦𝜑 → Ⅎ𝑦𝜓)
8		cbv1h.2	. . . 4 ⊢ (𝜑 → (𝜒 → ∀𝑥𝜒))
9	4, 8	syl 14	. . 3 ⊢ (∀𝑥∀𝑦𝜑 → (𝜒 → ∀𝑥𝜒))
10	1, 9	nfd 1416	. 2 ⊢ (∀𝑥∀𝑦𝜑 → Ⅎ𝑥𝜒)
11		cbv1h.3	. . 3 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 → 𝜒)))
12	4, 11	syl 14	. 2 ⊢ (∀𝑥∀𝑦𝜑 → (𝑥 = 𝑦 → (𝜓 → 𝜒)))
13	1, 2, 7, 10, 12	cbv1 1632	1 ⊢ (∀𝑥∀𝑦𝜑 → (∀𝑥𝜓 → ∀𝑦𝜒))

Syntax hints:   → wi 4  ∀wal 1241

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-4 1400  ax-i9 1423  ax-ial 1427  ax-i5r 1428

This theorem depends on definitions:  df-bi 110  df-nf 1350

This theorem is referenced by:  cbv2h  1634