MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  2reu5lem1 Structured version   Visualization version   GIF version

Theorem 2reu5lem1 3668
Description: Lemma for 2reu5 3671. Note that ∃!𝑥𝐴∃!𝑦𝐵𝜑 does not mean "there is exactly one 𝑥 in 𝐴 and exactly one 𝑦 in 𝐵 such that 𝜑 holds"; see comment for 2eu5 2656. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
Assertion
Ref Expression
2reu5lem1 (∃!𝑥𝐴 ∃!𝑦𝐵 𝜑 ↔ ∃!𝑥∃!𝑦(𝑥𝐴𝑦𝐵𝜑))
Distinct variable groups:   𝑦,𝐴   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥)   𝐵(𝑥,𝑦)

Proof of Theorem 2reu5lem1
StepHypRef Expression
1 df-reu 3068 . . 3 (∃!𝑦𝐵 𝜑 ↔ ∃!𝑦(𝑦𝐵𝜑))
21reubii 3303 . 2 (∃!𝑥𝐴 ∃!𝑦𝐵 𝜑 ↔ ∃!𝑥𝐴 ∃!𝑦(𝑦𝐵𝜑))
3 df-reu 3068 . . 3 (∃!𝑥𝐴 ∃!𝑦(𝑦𝐵𝜑) ↔ ∃!𝑥(𝑥𝐴 ∧ ∃!𝑦(𝑦𝐵𝜑)))
4 euanv 2625 . . . . . 6 (∃!𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) ↔ (𝑥𝐴 ∧ ∃!𝑦(𝑦𝐵𝜑)))
54bicomi 227 . . . . 5 ((𝑥𝐴 ∧ ∃!𝑦(𝑦𝐵𝜑)) ↔ ∃!𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
6 3anass 1097 . . . . . . 7 ((𝑥𝐴𝑦𝐵𝜑) ↔ (𝑥𝐴 ∧ (𝑦𝐵𝜑)))
76bicomi 227 . . . . . 6 ((𝑥𝐴 ∧ (𝑦𝐵𝜑)) ↔ (𝑥𝐴𝑦𝐵𝜑))
87eubii 2584 . . . . 5 (∃!𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) ↔ ∃!𝑦(𝑥𝐴𝑦𝐵𝜑))
95, 8bitri 278 . . . 4 ((𝑥𝐴 ∧ ∃!𝑦(𝑦𝐵𝜑)) ↔ ∃!𝑦(𝑥𝐴𝑦𝐵𝜑))
109eubii 2584 . . 3 (∃!𝑥(𝑥𝐴 ∧ ∃!𝑦(𝑦𝐵𝜑)) ↔ ∃!𝑥∃!𝑦(𝑥𝐴𝑦𝐵𝜑))
113, 10bitri 278 . 2 (∃!𝑥𝐴 ∃!𝑦(𝑦𝐵𝜑) ↔ ∃!𝑥∃!𝑦(𝑥𝐴𝑦𝐵𝜑))
122, 11bitri 278 1 (∃!𝑥𝐴 ∃!𝑦𝐵 𝜑 ↔ ∃!𝑥∃!𝑦(𝑥𝐴𝑦𝐵𝜑))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 399  w3a 1089  wcel 2110  ∃!weu 2567  ∃!wreu 3063
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918
This theorem depends on definitions:  df-bi 210  df-an 400  df-3an 1091  df-ex 1788  df-mo 2539  df-eu 2568  df-reu 3068
This theorem is referenced by:  2reu5lem3  3670
  Copyright terms: Public domain W3C validator