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

Theorem eupicka 2638
Description: Version of eupick 2637 with closed formulas. (Contributed by NM, 6-Sep-2008.)
Assertion
Ref Expression
eupicka ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → ∀𝑥(𝜑𝜓))

Proof of Theorem eupicka
StepHypRef Expression
1 nfeu1 2593 . . 3 𝑥∃!𝑥𝜑
2 nfe1 2161 . . 3 𝑥𝑥(𝜑𝜓)
31, 2nfan 1906 . 2 𝑥(∃!𝑥𝜑 ∧ ∃𝑥(𝜑𝜓))
4 eupick 2637 . 2 ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → (𝜑𝜓))
53, 4alrimi 2225 1 ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → ∀𝑥(𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wal 1545  wex 1786  ∃!weu 2572
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-10 2152  ax-11 2168  ax-12 2189
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-nf 1791  df-mo 2543  df-eu 2573
This theorem is referenced by:  eupickbi  2640  frege124d  44212  sbiota1  44885
  Copyright terms: Public domain W3C validator