Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mopick | Structured version Visualization version GIF version |
Description: "At most one" picks a variable value, eliminating an existential quantifier. (Contributed by NM, 27-Jan-1997.) (Proof shortened by Wolf Lammen, 17-Sep-2019.) |
Ref | Expression |
---|---|
mopick | ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → (𝜑 → 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-mo 2618 | . . 3 ⊢ (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) | |
2 | sp 2178 | . . . . 5 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → (𝜑 → 𝑥 = 𝑦)) | |
3 | pm3.45 623 | . . . . . . 7 ⊢ ((𝜑 → 𝑥 = 𝑦) → ((𝜑 ∧ 𝜓) → (𝑥 = 𝑦 ∧ 𝜓))) | |
4 | 3 | aleximi 1828 | . . . . . 6 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → (∃𝑥(𝜑 ∧ 𝜓) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜓))) |
5 | sb56 2273 | . . . . . . 7 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜓) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜓)) | |
6 | sp 2178 | . . . . . . 7 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜓) → (𝑥 = 𝑦 → 𝜓)) | |
7 | 5, 6 | sylbi 219 | . . . . . 6 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜓) → (𝑥 = 𝑦 → 𝜓)) |
8 | 4, 7 | syl6 35 | . . . . 5 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → (∃𝑥(𝜑 ∧ 𝜓) → (𝑥 = 𝑦 → 𝜓))) |
9 | 2, 8 | syl5d 73 | . . . 4 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → (∃𝑥(𝜑 ∧ 𝜓) → (𝜑 → 𝜓))) |
10 | 9 | exlimiv 1927 | . . 3 ⊢ (∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦) → (∃𝑥(𝜑 ∧ 𝜓) → (𝜑 → 𝜓))) |
11 | 1, 10 | sylbi 219 | . 2 ⊢ (∃*𝑥𝜑 → (∃𝑥(𝜑 ∧ 𝜓) → (𝜑 → 𝜓))) |
12 | 11 | imp 409 | 1 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → (𝜑 → 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∀wal 1531 ∃wex 1776 ∃*wmo 2616 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-10 2141 ax-12 2173 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 |
This theorem is referenced by: moexexlem 2707 eupick 2714 mopick2 2718 morex 3709 imadif 6432 metsscmetcld 23912 |
Copyright terms: Public domain | W3C validator |