Theorem cbv3 1735

Description: Rule used to change bound variables, using implicit substitution. Usage of this theorem is discouraged because proofs are encouraged to use the weaker cbv3v 1737 if possible. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 12-May-2018.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cbv3.1	⊢ Ⅎ𝑦𝜑
cbv3.2	⊢ Ⅎ𝑥𝜓
cbv3.3	⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓))

Assertion

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

Proof of Theorem cbv3

Step	Hyp	Ref	Expression
1		cbv3.1	. . 3 ⊢ Ⅎ𝑦𝜑
2	1	nfal 1569	. 2 ⊢ Ⅎ𝑦∀𝑥𝜑
3		cbv3.2	. . 3 ⊢ Ⅎ𝑥𝜓
4		cbv3.3	. . 3 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓))
5	3, 4	spim 1731	. 2 ⊢ (∀𝑥𝜑 → 𝜓)
6	2, 5	alrimi 1515	1 ⊢ (∀𝑥𝜑 → ∀𝑦𝜓)

Syntax hints:   → wi 4  ∀wal 1346  Ⅎwnf 1453

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-4 1503  ax-i9 1523  ax-ial 1527

This theorem depends on definitions:  df-bi 116  df-nf 1454

This theorem is referenced by:  cbv3h  1736  cbv3v  1737  cbv1  1738  mo2n  2047  mo23  2060  setindis  14002  bdsetindis  14004