Theorem cbval 1807

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
cbval.1	|- F/ y ph
cbval.2	|- F/ x ps
cbval.3	|- ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
cbval	|- ( A. x ph <-> A. y ps )

Proof of Theorem cbval

Step	Hyp	Ref	Expression
1		cbval.1	. . 3 |- F/ y ph
2	1	nfri 1572	. 2 |- ( ph -> A. y ph )
3		cbval.2	. . 3 |- F/ x ps
4	3	nfri 1572	. 2 |- ( ps -> A. x ps )
5		cbval.3	. 2 |- ( x = y -> ( ph <-> ps ) )
6	2, 4, 5	cbvalh 1806	1 |- ( A. x ph <-> A. y ps )

This proof depends on syntax axioms:   -> wi 4   <-> wb 105   A.wal 1400   F/wnf 1513

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587

This proof depends on definitions:  df-bi 117  df-nf 1514

This theorem is used by:  sb8  1909  cbval2  1977  sb8eu  2099  abbibcom  2352  cleqf  2417  cbvralf  2777  ralab2  2990  cbvralcsf  3210  dfssf  3238  dfss2f  3239  elintab  3981  cbviota  5345  sb8iota  5348  dffun6f  5393  dffun4f  5396  mptfvex  5794  findcard2  7197  findcard2s  7198