Theorem cbv1 1979

Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Oct-2016.)

Hypotheses

Ref	Expression
cbv1.1	|- (ph -> F/yps)
cbv1.2	|- (ph -> F/xch)
cbv1.3	|- (ph -> (x = y -> (ps -> ch)))

Assertion

Ref	Expression
cbv1	|- (A.xA.yph -> (A.xps -> A.ych))

Proof of Theorem cbv1

Step	Hyp	Ref	Expression
1		cbv1.1	. . 3 |- (ph -> F/yps)
2	1	nfrd 1763	. 2 |- (ph -> (ps -> A.yps))
3		cbv1.2	. . 3 |- (ph -> F/xch)
4	3	nfrd 1763	. 2 |- (ph -> (ch -> A.xch))
5		cbv1.3	. 2 |- (ph -> (x = y -> (ps -> ch)))
6	2, 4, 5	cbv1h 1978	1 |- (A.xA.yph -> (A.xps -> A.ych))

Syntax hints:   -> wi 4  A.wal 1540   F/wnf 1544

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925

This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545

This theorem is referenced by:  cbv3  1982