MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cdeqal1 Unicode version

Theorem cdeqal1 3095
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
StepHypRef Expression
1 cdeqnot.1 . . . 4  |- CondEq ( x  =  y  ->  ( ph 
<->  ps ) )
21cdeqri 3090 . . 3  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
32cbvalv 2036 . 2  |-  ( A. x ph  <->  A. y ps )
43cdeqth 3091 1  |- CondEq ( x  =  y  ->  ( A. x ph  <->  A. y ps ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 177   A.wal 1546  CondEqwcdeq 3087
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939
This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-cdeq 3088
  Copyright terms: Public domain W3C validator