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

Theorem 19.21-2 1932
Description: Version of 19.21 1931 with two quantifiers. (Contributed by NM, 4-Feb-2005.)
Hypotheses
Ref Expression
19.21-2.1  |-  F/ x ph
19.21-2.2  |-  F/ y
ph
Assertion
Ref Expression
19.21-2  |-  ( A. x A. y ( ph  ->  ps )  <->  ( ph  ->  A. x A. y ps ) )

Proof of Theorem 19.21-2
StepHypRef Expression
1 19.21-2.2 . . . 4  |-  F/ y
ph
2119.21 1931 . . 3  |-  ( A. y ( ph  ->  ps )  <->  ( ph  ->  A. y ps ) )
32albii 1659 . 2  |-  ( A. x A. y ( ph  ->  ps )  <->  A. x
( ph  ->  A. y ps ) )
4 19.21-2.1 . . 3  |-  F/ x ph
5419.21 1931 . 2  |-  ( A. x ( ph  ->  A. y ps )  <->  ( ph  ->  A. x A. y ps ) )
63, 5bitri 249 1  |-  ( A. x A. y ( ph  ->  ps )  <->  ( ph  ->  A. x A. y ps ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184   A.wal 1401   F/wnf 1635
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1637  ax-4 1650  ax-5 1723  ax-6 1769  ax-7 1812  ax-10 1859  ax-12 1876
This theorem depends on definitions:  df-bi 185  df-ex 1632  df-nf 1636
This theorem is referenced by:  2eu6OLD  2333  cotr2g  12864  dford4  35297
  Copyright terms: Public domain W3C validator