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

Theorem 2moex 2365
Description: Double quantification with "at most one." (Contributed by NM, 3-Dec-2001.)
Assertion
Ref Expression
2moex

Proof of Theorem 2moex
StepHypRef Expression
1 nfe1 1840 . . 3
21nfmo 2301 . 2
3 19.8a 1857 . . 3
43moimi 2340 . 2
52, 4alrimi 1877 1
Colors of variables: wff setvar class
Syntax hints:  ->wi 4  A.wal 1393  E.wex 1612  E*wmo 2283
This theorem is referenced by:  2eu2  2378  2eu5  2382
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999
This theorem depends on definitions:  df-bi 185  df-an 371  df-tru 1398  df-ex 1613  df-nf 1617  df-eu 2286  df-mo 2287
  Copyright terms: Public domain W3C validator