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

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

Proof of Theorem eupicka
StepHypRef Expression
1 nfeu1 2480 . . 3 𝑥∃!𝑥𝜑
2 nfe1 2027 . . 3 𝑥𝑥(𝜑𝜓)
31, 2nfan 1828 . 2 𝑥(∃!𝑥𝜑 ∧ ∃𝑥(𝜑𝜓))
4 eupick 2536 . 2 ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → (𝜑𝜓))
53, 4alrimi 2082 1 ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → ∀𝑥(𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  wal 1481  wex 1704  ∃!weu 2470
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
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:  eupickbi  2539  frege124d  38053  sbiota1  38635
  Copyright terms: Public domain W3C validator