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

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

Proof of Theorem eupicka
StepHypRef Expression
1 nfeu1 2615 . . 3 Ⅎ𝑥∃!𝑥𝜑
2 nfe1 2187 . . 3 Ⅎ𝑥∃𝑥(𝜑 ∧ 𝜓)
31, 2nfan 1932 . 2 Ⅎ𝑥(∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓))
4 eupick 2659 . 2 ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → (𝜑 → 𝜓))
53, 4alrimi 2250 1 ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → ∀𝑥(𝜑 → 𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568  ∃wex 1812  ∃!weu 2594
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 1943  ax-6 2000  ax-7 2041  ax-10 2178  ax-11 2194  ax-12 2213
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 2565  df-eu 2595
This theorem is used by:  eupickbi  2662  frege124d  44746  sbiota1  45403
  Copyright terms: Public domain W3C validator