Theorem cbv3 1670

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

Hypotheses

Ref	Expression
cbv3.1	|- F/ y ph
cbv3.2	|- F/ x ps
cbv3.3	|- ( x = y -> ( ph -> ps ) )

Assertion

Ref	Expression
cbv3	|- ( A. x ph -> A. y ps )

Proof of Theorem cbv3

Step	Hyp	Ref	Expression
1		cbv3.1	. . 3 |- F/ y ph
2	1	nfal 1508	. 2 |- F/ y A. x ph
3		cbv3.2	. . 3 |- F/ x ps
4		cbv3.3	. . 3 |- ( x = y -> ( ph -> ps ) )
5	3, 4	spim 1666	. 2 |- ( A. x ph -> ps )
6	2, 5	alrimi 1455	1 |- ( A. x ph -> A. y ps )

Syntax hints:   -> wi 4   A.wal 1282   F/wnf 1389

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-4 1440  ax-i9 1463  ax-ial 1467

This theorem depends on definitions:  df-bi 115  df-nf 1390

This theorem is referenced by:  cbv3h  1671  cbv1  1672  mo2n  1969  mo23  1982  setindis  10762  bdsetindis  10764