| 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 2403. Use the weaker 2euexv 2658 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 2596 | . 2 ⊢ (∃!𝑥∃𝑦𝜑 ↔ (∃𝑥∃𝑦𝜑 ∧ ∃*𝑥∃𝑦𝜑)) | |
| 2 | excom 2196 | . . . 4 ⊢ (∃𝑥∃𝑦𝜑 ↔ ∃𝑦∃𝑥𝜑) | |
| 3 | nfe1 2184 | . . . . . 6 ⊢ Ⅎ𝑦∃𝑦𝜑 | |
| 4 | 3 | nfmo 2589 | . . . . 5 ⊢ Ⅎ𝑦∃*𝑥∃𝑦𝜑 |
| 5 | 19.8a 2216 | . . . . . . 7 ⊢ (𝜑 → ∃𝑦𝜑) | |
| 6 | 5 | moimi 2572 | . . . . . 6 ⊢ (∃*𝑥∃𝑦𝜑 → ∃*𝑥𝜑) |
| 7 | moeu 2610 | . . . . . 6 ⊢ (∃*𝑥𝜑 ↔ (∃𝑥𝜑 → ∃!𝑥𝜑)) | |
| 8 | 6, 7 | sylib 220 | . . . . 5 ⊢ (∃*𝑥∃𝑦𝜑 → (∃𝑥𝜑 → ∃!𝑥𝜑)) |
| 9 | 4, 8 | eximd 2251 | . . . 4 ⊢ (∃*𝑥∃𝑦𝜑 → (∃𝑦∃𝑥𝜑 → ∃𝑦∃!𝑥𝜑)) |
| 10 | 2, 9 | biimtrid 244 | . . 3 ⊢ (∃*𝑥∃𝑦𝜑 → (∃𝑥∃𝑦𝜑 → ∃𝑦∃!𝑥𝜑)) |
| 11 | 10 | impcom 411 | . 2 ⊢ ((∃𝑥∃𝑦𝜑 ∧ ∃*𝑥∃𝑦𝜑) → ∃𝑦∃!𝑥𝜑) |
| 12 | 1, 11 | sylbi 219 | 1 ⊢ (∃!𝑥∃𝑦𝜑 → ∃𝑦∃!𝑥𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∃wex 1799 ∃*wmo 2564 ∃!weu 2595 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-10 2175 ax-11 2191 ax-12 2212 ax-13 2403 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1563 df-ex 1800 df-nf 1804 df-mo 2566 df-eu 2596 |
| This theorem is referenced by: 2exeu 2673 |
| Copyright terms: Public domain | W3C validator |