Theorem cbvral3v 2801

Description: Change bound variables of triple restricted universal quantification, using implicit substitution. (Contributed by NM, 10-May-2005.)

Hypotheses

Ref	Expression
cbvral3v.1	|- ( x = w -> ( ph <-> ch ) )
cbvral3v.2	|- ( y = v -> ( ch <-> th ) )
cbvral3v.3	|- ( z = u -> ( th <-> ps ) )

Assertion

Ref	Expression
cbvral3v	|- ( A. x e. A A. y e. B A. z e. C ph <-> A. w e. A A. v e. B A. u e. C ps )

Distinct variable groups:   ph, w   ps, z   ch, x   ch, v   y, u, th   x, A   w, A   x, y, B   y, w, B   v, B   x, z, C, y   z, w, C   z, v, C   u, C

Allowed substitution hints:   ph( x, y, z, v, u)   ps( x, y, w, v, u)   ch( y, z, w, u)   th( x, z, w, v)   A( y, z, v, u)   B( z, u)

Proof of Theorem cbvral3v

Step	Hyp	Ref	Expression
1		cbvral3v.1	. . . 4 |- ( x = w -> ( ph <-> ch ) )
2	1	2ralbidv 2574	. . 3 |- ( x = w -> ( A. y e. B A. z e. C ph <-> A. y e. B A. z e. C ch ) )
3	2	cbvralv 2786	. 2 |- ( A. x e. A A. y e. B A. z e. C ph <-> A. w e. A A. y e. B A. z e. C ch )
4		cbvral3v.2	. . . 4 |- ( y = v -> ( ch <-> th ) )
5		cbvral3v.3	. . . 4 |- ( z = u -> ( th <-> ps ) )
6	4, 5	cbvral2v 2799	. . 3 |- ( A. y e. B A. z e. C ch <-> A. v e. B A. u e. C ps )
7	6	ralbii 2556	. 2 |- ( A. w e. A A. y e. B A. z e. C ch <-> A. w e. A A. v e. B A. u e. C ps )
8	3, 7	bitri 184	1 |- ( A. x e. A A. y e. B A. z e. C ph <-> A. w e. A A. v e. B A. u e. C ps )

This proof depends on syntax axioms:   -> wi 4   <-> wb 105   A.wral 2528

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533

This theorem is used by: (None)