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

Theorem ralbiim 2899
Description: Split a biconditional and distribute quantifier. Restricted quantifier version of albiim 1746. (Contributed by NM, 3-Jun-2012.)
Assertion
Ref Expression
ralbiim  |-  ( A. x  e.  A  ( ph 
<->  ps )  <->  ( A. x  e.  A  ( ph  ->  ps )  /\  A. x  e.  A  ( ps  ->  ph ) ) )

Proof of Theorem ralbiim
StepHypRef Expression
1 dfbi2 632 . . 3  |-  ( (
ph 
<->  ps )  <->  ( ( ph  ->  ps )  /\  ( ps  ->  ph )
) )
21ralbii 2796 . 2  |-  ( A. x  e.  A  ( ph 
<->  ps )  <->  A. x  e.  A  ( ( ph  ->  ps )  /\  ( ps  ->  ph )
) )
3 r19.26 2894 . 2  |-  ( A. x  e.  A  (
( ph  ->  ps )  /\  ( ps  ->  ph )
)  <->  ( A. x  e.  A  ( ph  ->  ps )  /\  A. x  e.  A  ( ps  ->  ph ) ) )
42, 3bitri 252 1  |-  ( A. x  e.  A  ( ph 
<->  ps )  <->  ( A. x  e.  A  ( ph  ->  ps )  /\  A. x  e.  A  ( ps  ->  ph ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 187    /\ wa 370   A.wral 2714
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1663  ax-4 1676
This theorem depends on definitions:  df-bi 188  df-an 372  df-ral 2719
This theorem is referenced by:  eqreu  3205  isclo2  20046  chrelat4i  27968  hlateq  32876  2ralbiim  38409
  Copyright terms: Public domain W3C validator