Theorem cbv1h 2268

Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 11-May-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 2028	. 2 |- F/ x A. x A. y ph
2		nfa2 2040	. 2 |- F/ y A. x A. y ph
3		2sp 2056	. . . 4 |- ( A. x A. y ph -> ph )
4		cbv1h.1	. . . 4 |- ( ph -> ( ps -> A. y ps ) )
5	3, 4	syl 17	. . 3 |- ( A. x A. y ph -> ( ps -> A. y ps ) )
6	2, 5	nf5d 2118	. 2 |- ( A. x A. y ph -> F/ y ps )
7		cbv1h.2	. . . 4 |- ( ph -> ( ch -> A. x ch ) )
8	3, 7	syl 17	. . 3 |- ( A. x A. y ph -> ( ch -> A. x ch ) )
9	1, 8	nf5d 2118	. 2 |- ( A. x A. y ph -> F/ x ch )
10		cbv1h.3	. . 3 |- ( ph -> ( x = y -> ( ps -> ch ) ) )
11	3, 10	syl 17	. 2 |- ( A. x A. y ph -> ( x = y -> ( ps -> ch ) ) )
12	1, 2, 6, 9, 11	cbv1 2267	1 |- ( A. x A. y ph -> ( A. x ps -> A. y ch ) )

Syntax hints:   -> wi 4   A.wal 1481

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-ex 1705  df-nf 1710

This theorem is referenced by:  cbv2h  2269