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

Theorem ralinexa 2463
Description: A transformation of restricted quantifiers and logical connectives. (Contributed by NM, 4-Sep-2005.)
Assertion
Ref Expression
ralinexa  |-  ( A. x  e.  A  ( ph  ->  -.  ps )  <->  -. 
E. x  e.  A  ( ph  /\  ps )
)

Proof of Theorem ralinexa
StepHypRef Expression
1 imnan 680 . . 3  |-  ( (
ph  ->  -.  ps )  <->  -.  ( ph  /\  ps ) )
21ralbii 2442 . 2  |-  ( A. x  e.  A  ( ph  ->  -.  ps )  <->  A. x  e.  A  -.  ( ph  /\  ps )
)
3 ralnex 2427 . 2  |-  ( A. x  e.  A  -.  ( ph  /\  ps )  <->  -. 
E. x  e.  A  ( ph  /\  ps )
)
42, 3bitri 183 1  |-  ( A. x  e.  A  ( ph  ->  -.  ps )  <->  -. 
E. x  e.  A  ( ph  /\  ps )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104   A.wral 2417   E.wrex 2418
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-5 1424  ax-gen 1426  ax-ie2 1471  ax-4 1488  ax-17 1507
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-fal 1338  df-nf 1438  df-ral 2422  df-rex 2423
This theorem is referenced by:  ntreq0  12331
  Copyright terms: Public domain W3C validator