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

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

Proof of Theorem eupicka
StepHypRef Expression
1 nfeu1 2614 . . 3 Ⅎ𝑥∃!𝑥𝜑
2 nfe1 2186 . . 3 Ⅎ𝑥∃𝑥(𝜑 ∧ 𝜓)
31, 2nfan 1931 . 2 Ⅎ𝑥(∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓))
4 eupick 2658 . 2 ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → (𝜑 → 𝜓))
53, 4alrimi 2249 1 ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → ∀𝑥(𝜑 → 𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567  ∃wex 1811  ∃!weu 2593
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-11 2193  ax-12 2212
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-mo 2564  df-eu 2594
This theorem is used by:  eupickbi  2661  frege124d  44855  sbiota1  45512
  Copyright terms: Public domain W3C validator