![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 2eu8 | Structured version Visualization version GIF version |
Description: Two equivalent expressions for double existential uniqueness. Curiously, we can put ∃! on either of the internal conjuncts but not both. We can also commute ∃!𝑥∃!𝑦 using 2eu7 2547. (Contributed by NM, 20-Feb-2005.) |
Ref | Expression |
---|---|
2eu8 | ⊢ (∃!𝑥∃!𝑦(∃𝑥𝜑 ∧ ∃𝑦𝜑) ↔ ∃!𝑥∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2eu2 2542 | . . 3 ⊢ (∃!𝑥∃𝑦𝜑 → (∃!𝑦∃!𝑥𝜑 ↔ ∃!𝑦∃𝑥𝜑)) | |
2 | 1 | pm5.32i 667 | . 2 ⊢ ((∃!𝑥∃𝑦𝜑 ∧ ∃!𝑦∃!𝑥𝜑) ↔ (∃!𝑥∃𝑦𝜑 ∧ ∃!𝑦∃𝑥𝜑)) |
3 | nfeu1 2468 | . . . . 5 ⊢ Ⅎ𝑥∃!𝑥𝜑 | |
4 | 3 | nfeu 2474 | . . . 4 ⊢ Ⅎ𝑥∃!𝑦∃!𝑥𝜑 |
5 | 4 | euan 2518 | . . 3 ⊢ (∃!𝑥(∃!𝑦∃!𝑥𝜑 ∧ ∃𝑦𝜑) ↔ (∃!𝑦∃!𝑥𝜑 ∧ ∃!𝑥∃𝑦𝜑)) |
6 | ancom 465 | . . . . . 6 ⊢ ((∃!𝑥𝜑 ∧ ∃𝑦𝜑) ↔ (∃𝑦𝜑 ∧ ∃!𝑥𝜑)) | |
7 | 6 | eubii 2480 | . . . . 5 ⊢ (∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑) ↔ ∃!𝑦(∃𝑦𝜑 ∧ ∃!𝑥𝜑)) |
8 | nfe1 2014 | . . . . . 6 ⊢ Ⅎ𝑦∃𝑦𝜑 | |
9 | 8 | euan 2518 | . . . . 5 ⊢ (∃!𝑦(∃𝑦𝜑 ∧ ∃!𝑥𝜑) ↔ (∃𝑦𝜑 ∧ ∃!𝑦∃!𝑥𝜑)) |
10 | ancom 465 | . . . . 5 ⊢ ((∃𝑦𝜑 ∧ ∃!𝑦∃!𝑥𝜑) ↔ (∃!𝑦∃!𝑥𝜑 ∧ ∃𝑦𝜑)) | |
11 | 7, 9, 10 | 3bitri 285 | . . . 4 ⊢ (∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑) ↔ (∃!𝑦∃!𝑥𝜑 ∧ ∃𝑦𝜑)) |
12 | 11 | eubii 2480 | . . 3 ⊢ (∃!𝑥∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑) ↔ ∃!𝑥(∃!𝑦∃!𝑥𝜑 ∧ ∃𝑦𝜑)) |
13 | ancom 465 | . . 3 ⊢ ((∃!𝑥∃𝑦𝜑 ∧ ∃!𝑦∃!𝑥𝜑) ↔ (∃!𝑦∃!𝑥𝜑 ∧ ∃!𝑥∃𝑦𝜑)) | |
14 | 5, 12, 13 | 3bitr4ri 292 | . 2 ⊢ ((∃!𝑥∃𝑦𝜑 ∧ ∃!𝑦∃!𝑥𝜑) ↔ ∃!𝑥∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑)) |
15 | 2eu7 2547 | . 2 ⊢ ((∃!𝑥∃𝑦𝜑 ∧ ∃!𝑦∃𝑥𝜑) ↔ ∃!𝑥∃!𝑦(∃𝑥𝜑 ∧ ∃𝑦𝜑)) | |
16 | 2, 14, 15 | 3bitr3ri 290 | 1 ⊢ (∃!𝑥∃!𝑦(∃𝑥𝜑 ∧ ∃𝑦𝜑) ↔ ∃!𝑥∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 195 ∧ wa 383 ∃wex 1695 ∃!weu 2458 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-eu 2462 df-mo 2463 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |