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

Theorem 2albiim 1705
Description: Split a biconditional and distribute two quantifiers. (Contributed by NM, 3-Feb-2005.)
Assertion
Ref Expression
2albiim  |-  ( A. x A. y ( ph  <->  ps )  <->  ( A. x A. y ( ph  ->  ps )  /\  A. x A. y ( ps  ->  ph ) ) )

Proof of Theorem 2albiim
StepHypRef Expression
1 albiim 1704 . . 3  |-  ( A. y ( ph  <->  ps )  <->  ( A. y ( ph  ->  ps )  /\  A. y ( ps  ->  ph ) ) )
21albii 1645 . 2  |-  ( A. x A. y ( ph  <->  ps )  <->  A. x ( A. y ( ph  ->  ps )  /\  A. y
( ps  ->  ph )
) )
3 19.26 1685 . 2  |-  ( A. x ( A. y
( ph  ->  ps )  /\  A. y ( ps 
->  ph ) )  <->  ( A. x A. y ( ph  ->  ps )  /\  A. x A. y ( ps 
->  ph ) ) )
42, 3bitri 249 1  |-  ( A. x A. y ( ph  <->  ps )  <->  ( A. x A. y ( ph  ->  ps )  /\  A. x A. y ( ps  ->  ph ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 367   A.wal 1396
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636
This theorem depends on definitions:  df-bi 185  df-an 369
This theorem is referenced by:  sbnf2  2185  2eu6  2380  2eu6OLD  2381  eqopab2b  4766  eqrel  5080  eqrelrel  5092  eqoprab2b  6328  eqrelrd2  27682  pm14.123a  31573
  Copyright terms: Public domain W3C validator