ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  alinexa Unicode version

Theorem alinexa 1539
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 659 . . 3  |-  ( (
ph  ->  -.  ps )  <->  -.  ( ph  /\  ps ) )
21albii 1404 . 2  |-  ( A. x ( ph  ->  -. 
ps )  <->  A. x  -.  ( ph  /\  ps ) )
3 alnex 1433 . 2  |-  ( A. x  -.  ( ph  /\  ps )  <->  -.  E. x
( ph  /\  ps )
)
42, 3bitri 182 1  |-  ( A. x ( ph  ->  -. 
ps )  <->  -.  E. x
( ph  /\  ps )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102    <-> wb 103   A.wal 1287   E.wex 1426
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-5 1381  ax-gen 1383  ax-ie2 1428
This theorem depends on definitions:  df-bi 115  df-tru 1292  df-fal 1295
This theorem is referenced by:  sbnv  1816  ralnex  2369
  Copyright terms: Public domain W3C validator