Theorem 2reu5lem1 3712

Description: Lemma for 2reu5 3715. Note that ∃!𝑥 ∈ 𝐴∃!𝑦 ∈ 𝐵𝜑 does not mean "there is exactly one 𝑥 in 𝐴 and exactly one 𝑦 in 𝐵 such that 𝜑 holds"; see comment for 2eu5 2680. (Contributed by Alexander van der Vekens, 17-Jun-2017.)

Assertion

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

Distinct variable groups:   𝑦,𝐴   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥)   𝐵(𝑥, 𝑦)

Proof of Theorem 2reu5lem1

Step	Hyp	Ref	Expression
1		df-reu 3366	. . 3 ⊢ (∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑))
2	1	reubii 3374	. 2 ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑥 ∈ 𝐴 ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑))
3		df-reu 3366	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)))
4		euanv 2649	. . . . . 6 ⊢ (∃!𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)))
5	4	bicomi 227	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ ∃!𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑)))
6		3anass 1111	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑)))
7	6	bicomi 227	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑))
8	7	eubii 2610	. . . . 5 ⊢ (∃!𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ ∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑))
9	5, 8	bitri 278	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ ∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑))
10	9	eubii 2610	. . 3 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ ∃!𝑥∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑))
11	3, 10	bitri 278	. 2 ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦(𝑦 ∈ 𝐵 ∧ 𝜑) ↔ ∃!𝑥∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑))
12	2, 11	bitri 278	1 ⊢ (∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑥∃!𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝜑))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2144  ∃!weu 2593  ∃!wreu 3363

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-ex 1812  df-mo 2564  df-eu 2594  df-reu 3366

This theorem is used by:  2reu5lem3  3714