Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mopick2 | Structured version Visualization version GIF version |
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 1785. (Contributed by NM, 5-Apr-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) |
Ref | Expression |
---|---|
mopick2 | ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓) ∧ ∃𝑥(𝜑 ∧ 𝜒)) → ∃𝑥(𝜑 ∧ 𝜓 ∧ 𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfmo1 2469 | . . . 4 ⊢ Ⅎ𝑥∃*𝑥𝜑 | |
2 | nfe1 2014 | . . . 4 ⊢ Ⅎ𝑥∃𝑥(𝜑 ∧ 𝜓) | |
3 | 1, 2 | nfan 1816 | . . 3 ⊢ Ⅎ𝑥(∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) |
4 | mopick 2523 | . . . . . 6 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → (𝜑 → 𝜓)) | |
5 | 4 | ancld 574 | . . . . 5 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → (𝜑 → (𝜑 ∧ 𝜓))) |
6 | 5 | anim1d 586 | . . . 4 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → ((𝜑 ∧ 𝜒) → ((𝜑 ∧ 𝜓) ∧ 𝜒))) |
7 | df-3an 1033 | . . . 4 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ ((𝜑 ∧ 𝜓) ∧ 𝜒)) | |
8 | 6, 7 | syl6ibr 241 | . . 3 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → ((𝜑 ∧ 𝜒) → (𝜑 ∧ 𝜓 ∧ 𝜒))) |
9 | 3, 8 | eximd 2072 | . 2 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → (∃𝑥(𝜑 ∧ 𝜒) → ∃𝑥(𝜑 ∧ 𝜓 ∧ 𝜒))) |
10 | 9 | 3impia 1253 | 1 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓) ∧ ∃𝑥(𝜑 ∧ 𝜒)) → ∃𝑥(𝜑 ∧ 𝜓 ∧ 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 ∃wex 1695 ∃*wmo 2459 |
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-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-eu 2462 df-mo 2463 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |