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

Theorem alinexa 1663
Description: A transformation of quantifiers and logical connectives. (Contributed by NM, 19-Aug-1993.)
Assertion
Ref Expression
alinexa

Proof of Theorem alinexa
StepHypRef Expression
1 imnan 422 . . 3
21albii 1640 . 2
3 alnex 1614 . 2
42, 3bitri 249 1
Colors of variables: wff setvar class
Syntax hints:  -.wn 3  ->wi 4  <->wb 184  /\wa 369  A.wal 1393  E.wex 1612
This theorem is referenced by:  equs3  1734  ralnex  2903  r2exlem  2977  zfregs2  8185  ac6n  8886  nnunb  10816  alexsubALTlem3  20549  nmobndseqi  25694  zfregs2VD  33641  bj-exnalimn  34221
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631
This theorem depends on definitions:  df-bi 185  df-an 371  df-ex 1613
  Copyright terms: Public domain W3C validator