Theorem 2eu8 2688

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 2687. Usage of this theorem is discouraged because it depends on ax-13 2406. (Contributed by NM, 20-Feb-2005.) (New usage is discouraged.)

Assertion

Ref	Expression
2eu8	⊢ (∃!𝑥∃!𝑦(∃𝑥𝜑 ∧ ∃𝑦𝜑) ↔ ∃!𝑥∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑))

Proof of Theorem 2eu8

Step	Hyp	Ref	Expression
1		2eu2 2682	. . 3 ⊢ (∃!𝑥∃𝑦𝜑 → (∃!𝑦∃!𝑥𝜑 ↔ ∃!𝑦∃𝑥𝜑))
2	1	pm5.32i 585	. 2 ⊢ ((∃!𝑥∃𝑦𝜑 ∧ ∃!𝑦∃!𝑥𝜑) ↔ (∃!𝑥∃𝑦𝜑 ∧ ∃!𝑦∃𝑥𝜑))
3		nfeu1 2619	. . . . 5 ⊢ Ⅎ𝑥∃!𝑥𝜑
4	3	nfeu 2624	. . . 4 ⊢ Ⅎ𝑥∃!𝑦∃!𝑥𝜑
5	4	euan 2651	. . 3 ⊢ (∃!𝑥(∃!𝑦∃!𝑥𝜑 ∧ ∃𝑦𝜑) ↔ (∃!𝑦∃!𝑥𝜑 ∧ ∃!𝑥∃𝑦𝜑))
6		ancom 466	. . . . . 6 ⊢ ((∃!𝑥𝜑 ∧ ∃𝑦𝜑) ↔ (∃𝑦𝜑 ∧ ∃!𝑥𝜑))
7	6	eubii 2615	. . . . 5 ⊢ (∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑) ↔ ∃!𝑦(∃𝑦𝜑 ∧ ∃!𝑥𝜑))
8		nfe1 2188	. . . . . 6 ⊢ Ⅎ𝑦∃𝑦𝜑
9	8	euan 2651	. . . . 5 ⊢ (∃!𝑦(∃𝑦𝜑 ∧ ∃!𝑥𝜑) ↔ (∃𝑦𝜑 ∧ ∃!𝑦∃!𝑥𝜑))
10		ancom 466	. . . . 5 ⊢ ((∃𝑦𝜑 ∧ ∃!𝑦∃!𝑥𝜑) ↔ (∃!𝑦∃!𝑥𝜑 ∧ ∃𝑦𝜑))
11	7, 9, 10	3bitri 300	. . . 4 ⊢ (∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑) ↔ (∃!𝑦∃!𝑥𝜑 ∧ ∃𝑦𝜑))
12	11	eubii 2615	. . 3 ⊢ (∃!𝑥∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑) ↔ ∃!𝑥(∃!𝑦∃!𝑥𝜑 ∧ ∃𝑦𝜑))
13		ancom 466	. . 3 ⊢ ((∃!𝑥∃𝑦𝜑 ∧ ∃!𝑦∃!𝑥𝜑) ↔ (∃!𝑦∃!𝑥𝜑 ∧ ∃!𝑥∃𝑦𝜑))
14	5, 12, 13	3bitr4ri 307	. 2 ⊢ ((∃!𝑥∃𝑦𝜑 ∧ ∃!𝑦∃!𝑥𝜑) ↔ ∃!𝑥∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑))
15		2eu7 2687	. 2 ⊢ ((∃!𝑥∃𝑦𝜑 ∧ ∃!𝑦∃𝑥𝜑) ↔ ∃!𝑥∃!𝑦(∃𝑥𝜑 ∧ ∃𝑦𝜑))
16	2, 14, 15	3bitr3ri 305	1 ⊢ (∃!𝑥∃!𝑦(∃𝑥𝜑 ∧ ∃𝑦𝜑) ↔ ∃!𝑥∃!𝑦(∃!𝑥𝜑 ∧ ∃𝑦𝜑))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∃wex 1812  ∃!weu 2598

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2179  ax-11 2195  ax-12 2216  ax-13 2406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2569  df-eu 2599

This theorem is used by: (None)