Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > euan | Structured version Visualization version GIF version |
Description: Introduction of a conjunct into uniqueness quantifier. (Contributed by NM, 19-Feb-2005.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) (Proof shortened by Wolf Lammen, 24-Dec-2018.) |
Ref | Expression |
---|---|
moanim.1 | ⊢ Ⅎ𝑥𝜑 |
Ref | Expression |
---|---|
euan | ⊢ (∃!𝑥(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃!𝑥𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | euex 2494 | . . . 4 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → ∃𝑥(𝜑 ∧ 𝜓)) | |
2 | moanim.1 | . . . . 5 ⊢ Ⅎ𝑥𝜑 | |
3 | simpl 473 | . . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝜑) | |
4 | 2, 3 | exlimi 2086 | . . . 4 ⊢ (∃𝑥(𝜑 ∧ 𝜓) → 𝜑) |
5 | 1, 4 | syl 17 | . . 3 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → 𝜑) |
6 | ibar 525 | . . . . 5 ⊢ (𝜑 → (𝜓 ↔ (𝜑 ∧ 𝜓))) | |
7 | 2, 6 | eubid 2488 | . . . 4 ⊢ (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥(𝜑 ∧ 𝜓))) |
8 | 7 | biimprcd 240 | . . 3 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → (𝜑 → ∃!𝑥𝜓)) |
9 | 5, 8 | jcai 559 | . 2 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → (𝜑 ∧ ∃!𝑥𝜓)) |
10 | 7 | biimpa 501 | . 2 ⊢ ((𝜑 ∧ ∃!𝑥𝜓) → ∃!𝑥(𝜑 ∧ 𝜓)) |
11 | 9, 10 | impbii 199 | 1 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃!𝑥𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∧ wa 384 ∃wex 1704 Ⅎwnf 1708 ∃!weu 2470 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-12 2047 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-ex 1705 df-nf 1710 df-eu 2474 |
This theorem is referenced by: euanv 2534 2eu7 2559 2eu8 2560 |
Copyright terms: Public domain | W3C validator |