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

Theorem 2moex 2668
Description: Double quantification with "at most one". Usage of this theorem is discouraged because it depends on ax-13 2404. Use the weaker 2moexv 2655 when possible. (Contributed by NM, 3-Dec-2001.) (New usage is discouraged.)
Assertion
Ref Expression
2moex (∃*𝑥∃𝑦𝜑 → ∀𝑦∃*𝑥𝜑)

Proof of Theorem 2moex
StepHypRef Expression
1 nfe1 2190 . . 3 Ⅎ𝑦∃𝑦𝜑
21nfmo 2590 . 2 Ⅎ𝑦∃*𝑥∃𝑦𝜑
3 19.8a 2221 . . 3 (𝜑 → ∃𝑦𝜑)
43moimi 2573 . 2 (∃*𝑥∃𝑦𝜑 → ∃*𝑥𝜑)
52, 4alrimi 2253 1 (∃*𝑥∃𝑦𝜑 → ∀𝑦∃*𝑥𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∀wal 1568  ∃wex 1812  ∃*wmo 2565
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-10 2180  ax-11 2197  ax-12 2216  ax-13 2404
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2567
This theorem is used by:  2eu2  2680
  Copyright terms: Public domain W3C validator