![]() |
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 2363. Use the weaker 2euexv 2619 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 2555 | . 2 ⊢ (∃!𝑥∃𝑦𝜑 ↔ (∃𝑥∃𝑦𝜑 ∧ ∃*𝑥∃𝑦𝜑)) | |
2 | excom 2154 | . . . 4 ⊢ (∃𝑥∃𝑦𝜑 ↔ ∃𝑦∃𝑥𝜑) | |
3 | nfe1 2139 | . . . . . 6 ⊢ Ⅎ𝑦∃𝑦𝜑 | |
4 | 3 | nfmo 2548 | . . . . 5 ⊢ Ⅎ𝑦∃*𝑥∃𝑦𝜑 |
5 | 19.8a 2166 | . . . . . . 7 ⊢ (𝜑 → ∃𝑦𝜑) | |
6 | 5 | moimi 2531 | . . . . . 6 ⊢ (∃*𝑥∃𝑦𝜑 → ∃*𝑥𝜑) |
7 | moeu 2569 | . . . . . 6 ⊢ (∃*𝑥𝜑 ↔ (∃𝑥𝜑 → ∃!𝑥𝜑)) | |
8 | 6, 7 | sylib 217 | . . . . 5 ⊢ (∃*𝑥∃𝑦𝜑 → (∃𝑥𝜑 → ∃!𝑥𝜑)) |
9 | 4, 8 | eximd 2201 | . . . 4 ⊢ (∃*𝑥∃𝑦𝜑 → (∃𝑦∃𝑥𝜑 → ∃𝑦∃!𝑥𝜑)) |
10 | 2, 9 | biimtrid 241 | . . 3 ⊢ (∃*𝑥∃𝑦𝜑 → (∃𝑥∃𝑦𝜑 → ∃𝑦∃!𝑥𝜑)) |
11 | 10 | impcom 407 | . 2 ⊢ ((∃𝑥∃𝑦𝜑 ∧ ∃*𝑥∃𝑦𝜑) → ∃𝑦∃!𝑥𝜑) |
12 | 1, 11 | sylbi 216 | 1 ⊢ (∃!𝑥∃𝑦𝜑 → ∃𝑦∃!𝑥𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∃wex 1773 ∃*wmo 2524 ∃!weu 2554 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-10 2129 ax-11 2146 ax-12 2163 ax-13 2363 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-tru 1536 df-ex 1774 df-nf 1778 df-mo 2526 df-eu 2555 |
This theorem is referenced by: 2exeu 2634 |
Copyright terms: Public domain | W3C validator |