Theorem 2reu8 43668

Description: Two equivalent expressions for double restricted existential uniqueness, analogous to 2eu8 2721. Curiously, we can put ∃! on either of the internal conjuncts but not both. We can also commute ∃!𝑥 ∈ 𝐴∃!𝑦 ∈ 𝐵 using 2reu7 43667. (Contributed by Alexander van der Vekens, 2-Jul-2017.)

Assertion

Ref	Expression
2reu8	⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑) ↔ ∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 (∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem 2reu8

Step	Hyp	Ref	Expression
1		2reu2 3827	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → (∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑))
2	1	pm5.32i 578	. 2 ⊢ ((∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑) ↔ (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑))
3		nfcv 2955	. . . . 5 ⊢ Ⅎ𝑥𝐵
4		nfreu1 3323	. . . . 5 ⊢ Ⅎ𝑥∃!𝑥 ∈ 𝐴 𝜑
5	3, 4	nfreuw 3327	. . . 4 ⊢ Ⅎ𝑥∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑
6	5	reuan 3825	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 (∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑) ↔ (∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑))
7		ancom 464	. . . . . 6 ⊢ ((∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑) ↔ (∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑥 ∈ 𝐴 𝜑))
8	7	reubii 3344	. . . . 5 ⊢ (∃!𝑦 ∈ 𝐵 (∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑) ↔ ∃!𝑦 ∈ 𝐵 (∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑥 ∈ 𝐴 𝜑))
9		nfre1 3265	. . . . . 6 ⊢ Ⅎ𝑦∃𝑦 ∈ 𝐵 𝜑
10	9	reuan 3825	. . . . 5 ⊢ (∃!𝑦 ∈ 𝐵 (∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑥 ∈ 𝐴 𝜑) ↔ (∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑))
11		ancom 464	. . . . 5 ⊢ ((∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑) ↔ (∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑))
12	8, 10, 11	3bitri 300	. . . 4 ⊢ (∃!𝑦 ∈ 𝐵 (∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑) ↔ (∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑))
13	12	reubii 3344	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 (∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑) ↔ ∃!𝑥 ∈ 𝐴 (∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑))
14		ancom 464	. . 3 ⊢ ((∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑) ↔ (∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑))
15	6, 13, 14	3bitr4ri 307	. 2 ⊢ ((∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑) ↔ ∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 (∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑))
16		2reu7 43667	. 2 ⊢ ((∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑) ↔ ∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑))
17	2, 15, 16	3bitr3ri 305	1 ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑) ↔ ∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 (∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜑))

Syntax hints:   ↔ wb 209   ∧ wa 399  ∃wrex 3107  ∃!wreu 3108

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114

This theorem is referenced by: (None)