Theorem cdeqal1 2900

Description: Distribute conditional equality over quantification. (Contributed by Mario Carneiro, 11-Aug-2016.)

Hypothesis

Ref	Expression
cdeqnot.1	|- CondEq ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
cdeqal1	|- CondEq ( x = y -> ( A. x ph <-> A. y ps ) )

Distinct variable groups:   ps, x   ph, y

Allowed substitution hints:   ph( x)   ps( y)

Proof of Theorem cdeqal1

Step	Hyp	Ref	Expression
1		cdeqnot.1	. . . 4 |- CondEq ( x = y -> ( ph <-> ps ) )
2	1	cdeqri 2895	. . 3 |- ( x = y -> ( ph <-> ps ) )
3	2	cbvalv 1889	. 2 |- ( A. x ph <-> A. y ps )
4	3	cdeqth 2896	1 |- CondEq ( x = y -> ( A. x ph <-> A. y ps ) )

Syntax hints:   <-> wb 104   A.wal 1329  CondEqwcdeq 2892

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514

This theorem depends on definitions:  df-bi 116  df-nf 1437  df-cdeq 2893

This theorem is referenced by: (None)