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

Theorem mopick2 2690
 Description: "At most one" can show the existence of a common value. In this case we can infer existence of conjunction from a conjunction of existence, and it is one way to achieve the converse of 19.40 1866. (Contributed by NM, 5-Apr-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
Assertion
Ref Expression
mopick2 ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑𝜓) ∧ ∃𝑥(𝜑𝜒)) → ∃𝑥(𝜑𝜓𝜒))

Proof of Theorem mopick2
StepHypRef Expression
1 nfmo1 2595 . . . 4 𝑥∃*𝑥𝜑
2 nfe1 2118 . . . 4 𝑥𝑥(𝜑𝜓)
31, 2nfan 1879 . . 3 𝑥(∃*𝑥𝜑 ∧ ∃𝑥(𝜑𝜓))
4 mopick 2678 . . . . . 6 ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → (𝜑𝜓))
54ancld 551 . . . . 5 ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → (𝜑 → (𝜑𝜓)))
65anim1d 610 . . . 4 ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → ((𝜑𝜒) → ((𝜑𝜓) ∧ 𝜒)))
7 df-3an 1080 . . . 4 ((𝜑𝜓𝜒) ↔ ((𝜑𝜓) ∧ 𝜒))
86, 7syl6ibr 253 . . 3 ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → ((𝜑𝜒) → (𝜑𝜓𝜒)))
93, 8eximd 2179 . 2 ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → (∃𝑥(𝜑𝜒) → ∃𝑥(𝜑𝜓𝜒)))
1093impia 1108 1 ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑𝜓) ∧ ∃𝑥(𝜑𝜒)) → ∃𝑥(𝜑𝜓𝜒))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1078  ∃wex 1759  ∃*wmo 2572 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1775  ax-4 1789  ax-5 1886  ax-6 1945  ax-7 1990  ax-10 2110  ax-11 2124  ax-12 2139 This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1080  df-tru 1523  df-ex 1760  df-nf 1764  df-sb 2041  df-mo 2574 This theorem is referenced by:  moantr  35098
 Copyright terms: Public domain W3C validator