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

Theorem alinexa 1631
Description: A transformation of quantifiers and logical connectives. (Contributed by NM, 19-Aug-1993.)
Assertion
Ref Expression
alinexa  |-  ( A. x ( ph  ->  -. 
ps )  <->  -.  E. x
( ph  /\  ps )
)

Proof of Theorem alinexa
StepHypRef Expression
1 imnan 422 . . 3  |-  ( (
ph  ->  -.  ps )  <->  -.  ( ph  /\  ps ) )
21albii 1611 . 2  |-  ( A. x ( ph  ->  -. 
ps )  <->  A. x  -.  ( ph  /\  ps ) )
3 alnex 1589 . 2  |-  ( A. x  -.  ( ph  /\  ps )  <->  -.  E. x
( ph  /\  ps )
)
42, 3bitri 249 1  |-  ( A. x ( ph  ->  -. 
ps )  <->  -.  E. x
( ph  /\  ps )
)
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 369   A.wal 1368   E.wex 1587
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603
This theorem depends on definitions:  df-bi 185  df-an 371  df-ex 1588
This theorem is referenced by:  equs3  1697  ralnex  2841  zfregs2  8056  ac6n  8757  nnunb  10678  alexsubALTlem3  19739  nmobndseqi  24316  zfregs2VD  31879  bj-exnalimn  32466
  Copyright terms: Public domain W3C validator