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

Theorem eupickbi 2527
 Description: Theorem *14.26 in [WhiteheadRussell] p. 192. (Contributed by Andrew Salmon, 11-Jul-2011.) (Proof shortened by Wolf Lammen, 27-Dec-2018.)
Assertion
Ref Expression
eupickbi (∃!𝑥𝜑 → (∃𝑥(𝜑𝜓) ↔ ∀𝑥(𝜑𝜓)))

Proof of Theorem eupickbi
StepHypRef Expression
1 eupicka 2525 . . 3 ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → ∀𝑥(𝜑𝜓))
21ex 449 . 2 (∃!𝑥𝜑 → (∃𝑥(𝜑𝜓) → ∀𝑥(𝜑𝜓)))
3 euex 2482 . . 3 (∃!𝑥𝜑 → ∃𝑥𝜑)
4 exintr 1810 . . 3 (∀𝑥(𝜑𝜓) → (∃𝑥𝜑 → ∃𝑥(𝜑𝜓)))
53, 4syl5com 31 . 2 (∃!𝑥𝜑 → (∀𝑥(𝜑𝜓) → ∃𝑥(𝜑𝜓)))
62, 5impbid 201 1 (∃!𝑥𝜑 → (∃𝑥(𝜑𝜓) ↔ ∀𝑥(𝜑𝜓)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383  ∀wal 1473  ∃wex 1695  ∃!weu 2458 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-eu 2462  df-mo 2463 This theorem is referenced by:  sbaniota  37658
 Copyright terms: Public domain W3C validator