Theorem cbv1h 1739

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	|- ( ph -> ( ps -> A. y ps ) )
cbv1h.2	|- ( ph -> ( ch -> A. x ch ) )
cbv1h.3	|- ( ph -> ( x = y -> ( ps -> ch ) ) )

Assertion

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

Proof of Theorem cbv1h

Step	Hyp	Ref	Expression
1		nfa1 1534	. 2 |- F/ x A. x A. y ph
2		nfa2 1572	. 2 |- F/ y A. x A. y ph
3		sp 1504	. . . . 5 |- ( A. y ph -> ph )
4	3	sps 1530	. . . 4 |- ( A. x A. y ph -> ph )
5		cbv1h.1	. . . 4 |- ( ph -> ( ps -> A. y ps ) )
6	4, 5	syl 14	. . 3 |- ( A. x A. y ph -> ( ps -> A. y ps ) )
7	2, 6	nfd 1516	. 2 |- ( A. x A. y ph -> F/ y ps )
8		cbv1h.2	. . . 4 |- ( ph -> ( ch -> A. x ch ) )
9	4, 8	syl 14	. . 3 |- ( A. x A. y ph -> ( ch -> A. x ch ) )
10	1, 9	nfd 1516	. 2 |- ( A. x A. y ph -> F/ x ch )
11		cbv1h.3	. . 3 |- ( ph -> ( x = y -> ( ps -> ch ) ) )
12	4, 11	syl 14	. 2 |- ( A. x A. y ph -> ( x = y -> ( ps -> ch ) ) )
13	1, 2, 7, 10, 12	cbv1 1738	1 |- ( A. x A. y ph -> ( A. x ps -> A. y ch ) )

Syntax hints:   -> wi 4   A.wal 1346

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  ax-i5r 1528

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

This theorem is referenced by:  cbv2h  1741