Theorem cbvralv2 3151

Description: Rule used to change the bound variable in a restricted universal quantifier with implicit substitution which also changes the quantifier domain. (Contributed by David Moews, 1-May-2017.)

Hypotheses

Ref	Expression
cbvralv2.1	|- ( x = y -> ( ps <-> ch ) )
cbvralv2.2	|- ( x = y -> A = B )

Assertion

Ref	Expression
cbvralv2	|- ( A. x e. A ps <-> A. y e. B ch )

Distinct variable groups:   y, A   ps, y   x, B   ch, x

Allowed substitution hints:   ps( x)   ch( y)   A( x)   B( y)

Proof of Theorem cbvralv2

Step	Hyp	Ref	Expression
1		nfcv 2339	. 2 |- F/_ y A
2		nfcv 2339	. 2 |- F/_ x B
3		nfv 1542	. 2 |- F/ y ps
4		nfv 1542	. 2 |- F/ x ch
5		cbvralv2.2	. 2 |- ( x = y -> A = B )
6		cbvralv2.1	. 2 |- ( x = y -> ( ps <-> ch ) )
7	1, 2, 3, 4, 5, 6	cbvralcsf 3147	1 |- ( A. x e. A ps <-> A. y e. B ch )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1364   A.wral 2475

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-sbc 2990  df-csb 3085

This theorem is referenced by: (None)