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

Theorem 2nalexn 1649
Description: Part of theorem *11.5 in [WhiteheadRussell] p. 164. (Contributed by Andrew Salmon, 24-May-2011.)
Assertion
Ref Expression
2nalexn

Proof of Theorem 2nalexn
StepHypRef Expression
1 df-ex 1613 . . 3
2 alex 1647 . . . 4
32albii 1640 . . 3
41, 3xchbinxr 311 . 2
54bicomi 202 1
Colors of variables: wff setvar class
Syntax hints:  -.wn 3  <->wb 184  A.wal 1393  E.wex 1612
This theorem is referenced by:  spc2gv  3197  hashfun  12495  spc2d  27373  pm11.52  31292  2exanali  31293
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-ex 1613
  Copyright terms: Public domain W3C validator