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

Theorem moexexv 2542
Description: "At most one" double quantification. (Contributed by NM, 26-Jan-1997.)
Assertion
Ref Expression
moexexv ((∃*𝑥𝜑 ∧ ∀𝑥∃*𝑦𝜓) → ∃*𝑦𝑥(𝜑𝜓))
Distinct variable group:   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥,𝑦)

Proof of Theorem moexexv
StepHypRef Expression
1 nfv 1843 . 2 𝑦𝜑
21moexex 2541 1 ((∃*𝑥𝜑 ∧ ∀𝑥∃*𝑦𝜓) → ∃*𝑦𝑥(𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  wal 1481  wex 1704  ∃*wmo 2471
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-eu 2474  df-mo 2475
This theorem is referenced by:  mosub  3384  funco  5928
  Copyright terms: Public domain W3C validator