| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > euanv | Structured version Visualization version GIF version | ||
| Description: Introduction of a conjunct into unique existential quantifier. (Contributed by NM, 23-Mar-1995.) Reduce dependencies on axioms. (Revised by Wolf Lammen, 14-Jan-2023.) |
| Ref | Expression |
|---|---|
| euanv | ⊢ (∃!𝑥(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃!𝑥𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | euex 2581 | . . . 4 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → ∃𝑥(𝜑 ∧ 𝜓)) | |
| 2 | simpl 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝜑) | |
| 3 | 2 | exlimiv 1937 | . . . 4 ⊢ (∃𝑥(𝜑 ∧ 𝜓) → 𝜑) |
| 4 | 1, 3 | syl 17 | . . 3 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → 𝜑) |
| 5 | ibar 533 | . . . . 5 ⊢ (𝜑 → (𝜓 ↔ (𝜑 ∧ 𝜓))) | |
| 6 | 5 | eubidv 2590 | . . . 4 ⊢ (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥(𝜑 ∧ 𝜓))) |
| 7 | 6 | biimprcd 251 | . . 3 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → (𝜑 → ∃!𝑥𝜓)) |
| 8 | 4, 7 | jcai 521 | . 2 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → (𝜑 ∧ ∃!𝑥𝜓)) |
| 9 | 6 | biimpa 477 | . 2 ⊢ ((𝜑 ∧ ∃!𝑥𝜓) → ∃!𝑥(𝜑 ∧ 𝜓)) |
| 10 | 8, 9 | impbii 210 | 1 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃!𝑥𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 207 ∧ wa 396 ∃wex 1786 ∃!weu 2572 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1787 df-mo 2543 df-eu 2573 |
| This theorem is referenced by: eueq2 3651 2reu5lem1 3696 fsn 7077 dfac5lem5 10040 |
| Copyright terms: Public domain | W3C validator |