| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2euex | Structured version Visualization version GIF version | ||
| Description: Double quantification with existential uniqueness. Usage of this theorem is discouraged because it depends on ax-13 2374. Use the weaker 2euexv 2629 when possible. (Contributed by NM, 3-Dec-2001.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| 2euex | ⊢ (∃!𝑥∃𝑦𝜑 → ∃𝑦∃!𝑥𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-eu 2567 | . 2 ⊢ (∃!𝑥∃𝑦𝜑 ↔ (∃𝑥∃𝑦𝜑 ∧ ∃*𝑥∃𝑦𝜑)) | |
| 2 | excom 2167 | . . . 4 ⊢ (∃𝑥∃𝑦𝜑 ↔ ∃𝑦∃𝑥𝜑) | |
| 3 | nfe1 2155 | . . . . . 6 ⊢ Ⅎ𝑦∃𝑦𝜑 | |
| 4 | 3 | nfmo 2560 | . . . . 5 ⊢ Ⅎ𝑦∃*𝑥∃𝑦𝜑 |
| 5 | 19.8a 2186 | . . . . . . 7 ⊢ (𝜑 → ∃𝑦𝜑) | |
| 6 | 5 | moimi 2543 | . . . . . 6 ⊢ (∃*𝑥∃𝑦𝜑 → ∃*𝑥𝜑) |
| 7 | moeu 2581 | . . . . . 6 ⊢ (∃*𝑥𝜑 ↔ (∃𝑥𝜑 → ∃!𝑥𝜑)) | |
| 8 | 6, 7 | sylib 218 | . . . . 5 ⊢ (∃*𝑥∃𝑦𝜑 → (∃𝑥𝜑 → ∃!𝑥𝜑)) |
| 9 | 4, 8 | eximd 2221 | . . . 4 ⊢ (∃*𝑥∃𝑦𝜑 → (∃𝑦∃𝑥𝜑 → ∃𝑦∃!𝑥𝜑)) |
| 10 | 2, 9 | biimtrid 242 | . . 3 ⊢ (∃*𝑥∃𝑦𝜑 → (∃𝑥∃𝑦𝜑 → ∃𝑦∃!𝑥𝜑)) |
| 11 | 10 | impcom 407 | . 2 ⊢ ((∃𝑥∃𝑦𝜑 ∧ ∃*𝑥∃𝑦𝜑) → ∃𝑦∃!𝑥𝜑) |
| 12 | 1, 11 | sylbi 217 | 1 ⊢ (∃!𝑥∃𝑦𝜑 → ∃𝑦∃!𝑥𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∃wex 1780 ∃*wmo 2535 ∃!weu 2566 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-10 2146 ax-11 2162 ax-12 2182 ax-13 2374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-nf 1785 df-mo 2537 df-eu 2567 |
| This theorem is referenced by: 2exeu 2644 |
| Copyright terms: Public domain | W3C validator |