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

Theorem 2moswap 2369
Description: A condition allowing swap of "at most one" and existential quantifiers. (Contributed by NM, 10-Apr-2004.)
Assertion
Ref Expression
2moswap

Proof of Theorem 2moswap
StepHypRef Expression
1 nfe1 1840 . . . 4
21moexex 2363 . . 3
32expcom 435 . 2
4 19.8a 1857 . . . . 5
54pm4.71ri 633 . . . 4
65exbii 1667 . . 3
76mobii 2307 . 2
83, 7syl6ibr 227 1
Colors of variables: wff setvar class
Syntax hints:  ->wi 4  /\wa 369  A.wal 1393  E.wex 1612  E*wmo 2283
This theorem is referenced by:  2euswap  2370  2eu1OLD  2377  2rmoswap  32189
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-or 370  df-an 371  df-tru 1398  df-ex 1613  df-nf 1617  df-eu 2286  df-mo 2287
  Copyright terms: Public domain W3C validator