Theorem cbv3 1720

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 1555	. 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 1716	. 2 |- ( A. x ph -> ps )
6	2, 5	alrimi 1502	1 |- ( A. x ph -> A. y ps )

Syntax hints:   -> wi 4   A.wal 1329   F/wnf 1436

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 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-4 1487  ax-i9 1510  ax-ial 1514

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

This theorem is referenced by:  cbv3h  1721  cbv1  1722  mo2n  2025  mo23  2038  setindis  13154  bdsetindis  13156