Theorem cbv3 1525

Description: Rule used to change bound variables, using implicit substitition, that does not use ax-12 1310.

Hypotheses

Ref	Expression
cbv3.1	|- (ph -> A.yph)
cbv3.2	|- (ps -> A.xps)
cbv3.3	|- (x = y -> (ph -> ps))

Assertion

Ref	Expression
cbv3	|- (A.xph -> A.yps)

Proof of Theorem cbv3

Step	Hyp	Ref	Expression
1		cbv3.1	. . . 4 |- (ph -> A.yph)
2	1	imim2i 11	. . 3 |- ((ph -> ph) -> (ph -> A.yph))
3		cbv3.2	. . . 4 |- (ps -> A.xps)
4	3	a1i 8	. . 3 |- ((ph -> ph) -> (ps -> A.xps))
5		cbv3.3	. . . 4 |- (x = y -> (ph -> ps))
6	5	a1i 8	. . 3 |- ((ph -> ph) -> (x = y -> (ph -> ps)))
7	2, 4, 6	cbv1 1523	. 2 |- (A.xA.y(ph -> ph) -> (A.xph -> A.yps))
8		id 73	. . 3 |- (ph -> ph)
9	8	ax-gen 1305	. 2 |- A.y(ph -> ph)
10	7, 9	mpg 1332	1 |- (A.xph -> A.yps)

Syntax hints:   -> wi 3  A.wal 1296   = wceq 1298

This theorem is referenced by:  cbval 1527  ax16 1579  sb8 1637  ax16i 1647  mo 1787  ax10ext 16364

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-mp 7  ax-7 1304  ax-gen 1305  ax-4 1319  ax-5o 1321  ax-9o 1481

Copyright terms: Public domain