Theorem cbval2v 1313

Description: Rule used to change bound variables with implicit substitution.

Hypothesis

Ref	Expression
cbval2v.1	|- ((x = z /\ y = w) -> (ph <-> ps))

Assertion

Ref	Expression
cbval2v	|- (A.xA.yph <-> A.zA.wps)

Distinct variable groups:   z,w,ph   x,y,ps   x,w   y,z

Proof of Theorem cbval2v

Step	Hyp	Ref	Expression
1		ax-17 968	. 2 |- (ph -> A.zph)
2		ax-17 968	. 2 |- (ph -> A.wph)
3		ax-17 968	. 2 |- (ps -> A.xps)
4		ax-17 968	. 2 |- (ps -> A.yps)
5		cbval2v.1	. 2 |- ((x = z /\ y = w) -> (ph <-> ps))
6	1, 2, 3, 4, 5	cbval2 1311	1 |- (A.xA.yph <-> A.zA.wps)

Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 951   = wceq 953

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-12 965  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119

This theorem depends on definitions:  df-bi 147  df-an 225

Copyright terms: Public domain