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

Theorem 2reu5 3735
 Description: Double restricted existential uniqueness in terms of restricted existential quantification and restricted universal quantification, analogous to 2eu5 2743 and reu3 3704. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
Assertion
Ref Expression
2reu5 ((∃!𝑥𝐴 ∃!𝑦𝐵 𝜑 ∧ ∀𝑥𝐴 ∃*𝑦𝐵 𝜑) ↔ (∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∃𝑧𝐴𝑤𝐵𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))
Distinct variable groups:   𝑦,𝑤,𝑧,𝐴,𝑥   𝑤,𝐵   𝑥,𝑧,𝐵,𝑦   𝜑,𝑤,𝑧   𝑥,𝐴   𝑦,𝐵
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem 2reu5
StepHypRef Expression
1 r19.29r 3249 . . . . . . . 8 ((∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) → ∃𝑥𝐴 (∃𝑦𝐵 𝜑 ∧ ∀𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))
2 r19.29r 3249 . . . . . . . . 9 ((∃𝑦𝐵 𝜑 ∧ ∀𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) → ∃𝑦𝐵 (𝜑 ∧ (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))
32reximi 3237 . . . . . . . 8 (∃𝑥𝐴 (∃𝑦𝐵 𝜑 ∧ ∀𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) → ∃𝑥𝐴𝑦𝐵 (𝜑 ∧ (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))
4 pm3.35 802 . . . . . . . . . 10 ((𝜑 ∧ (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) → (𝑥 = 𝑧𝑦 = 𝑤))
54reximi 3237 . . . . . . . . 9 (∃𝑦𝐵 (𝜑 ∧ (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) → ∃𝑦𝐵 (𝑥 = 𝑧𝑦 = 𝑤))
65reximi 3237 . . . . . . . 8 (∃𝑥𝐴𝑦𝐵 (𝜑 ∧ (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) → ∃𝑥𝐴𝑦𝐵 (𝑥 = 𝑧𝑦 = 𝑤))
7 eleq1w 2898 . . . . . . . . . . . . 13 (𝑥 = 𝑧 → (𝑥𝐴𝑧𝐴))
8 eleq1w 2898 . . . . . . . . . . . . 13 (𝑦 = 𝑤 → (𝑦𝐵𝑤𝐵))
97, 8bi2anan9 638 . . . . . . . . . . . 12 ((𝑥 = 𝑧𝑦 = 𝑤) → ((𝑥𝐴𝑦𝐵) ↔ (𝑧𝐴𝑤𝐵)))
109biimpac 482 . . . . . . . . . . 11 (((𝑥𝐴𝑦𝐵) ∧ (𝑥 = 𝑧𝑦 = 𝑤)) → (𝑧𝐴𝑤𝐵))
1110ancomd 465 . . . . . . . . . 10 (((𝑥𝐴𝑦𝐵) ∧ (𝑥 = 𝑧𝑦 = 𝑤)) → (𝑤𝐵𝑧𝐴))
1211ex 416 . . . . . . . . 9 ((𝑥𝐴𝑦𝐵) → ((𝑥 = 𝑧𝑦 = 𝑤) → (𝑤𝐵𝑧𝐴)))
1312rexlimivv 3284 . . . . . . . 8 (∃𝑥𝐴𝑦𝐵 (𝑥 = 𝑧𝑦 = 𝑤) → (𝑤𝐵𝑧𝐴))
141, 3, 6, 134syl 19 . . . . . . 7 ((∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) → (𝑤𝐵𝑧𝐴))
1514ex 416 . . . . . 6 (∃𝑥𝐴𝑦𝐵 𝜑 → (∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)) → (𝑤𝐵𝑧𝐴)))
1615pm4.71rd 566 . . . . 5 (∃𝑥𝐴𝑦𝐵 𝜑 → (∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ((𝑤𝐵𝑧𝐴) ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)))))
17 anass 472 . . . . 5 (((𝑤𝐵𝑧𝐴) ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) ↔ (𝑤𝐵 ∧ (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)))))
1816, 17syl6bb 290 . . . 4 (∃𝑥𝐴𝑦𝐵 𝜑 → (∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ (𝑤𝐵 ∧ (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))))
19182exbidv 1926 . . 3 (∃𝑥𝐴𝑦𝐵 𝜑 → (∃𝑧𝑤𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ∃𝑧𝑤(𝑤𝐵 ∧ (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))))
2019pm5.32i 578 . 2 ((∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∃𝑧𝑤𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) ↔ (∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∃𝑧𝑤(𝑤𝐵 ∧ (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))))
21 2reu5lem3 3734 . 2 ((∃!𝑥𝐴 ∃!𝑦𝐵 𝜑 ∧ ∀𝑥𝐴 ∃*𝑦𝐵 𝜑) ↔ (∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∃𝑧𝑤𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))
22 df-rex 3139 . . . 4 (∃𝑧𝐴𝑤𝐵𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ∃𝑧(𝑧𝐴 ∧ ∃𝑤𝐵𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))
23 r19.42v 3341 . . . . . 6 (∃𝑤𝐵 (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) ↔ (𝑧𝐴 ∧ ∃𝑤𝐵𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))
24 df-rex 3139 . . . . . 6 (∃𝑤𝐵 (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) ↔ ∃𝑤(𝑤𝐵 ∧ (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)))))
2523, 24bitr3i 280 . . . . 5 ((𝑧𝐴 ∧ ∃𝑤𝐵𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) ↔ ∃𝑤(𝑤𝐵 ∧ (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)))))
2625exbii 1849 . . . 4 (∃𝑧(𝑧𝐴 ∧ ∃𝑤𝐵𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) ↔ ∃𝑧𝑤(𝑤𝐵 ∧ (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)))))
2722, 26bitri 278 . . 3 (∃𝑧𝐴𝑤𝐵𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ∃𝑧𝑤(𝑤𝐵 ∧ (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤)))))
2827anbi2i 625 . 2 ((∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∃𝑧𝐴𝑤𝐵𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))) ↔ (∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∃𝑧𝑤(𝑤𝐵 ∧ (𝑧𝐴 ∧ ∀𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))))
2920, 21, 283bitr4i 306 1 ((∃!𝑥𝐴 ∃!𝑦𝐵 𝜑 ∧ ∀𝑥𝐴 ∃*𝑦𝐵 𝜑) ↔ (∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∃𝑧𝐴𝑤𝐵𝑥𝐴𝑦𝐵 (𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399  ∃wex 1781   ∈ wcel 2115  ∀wral 3133  ∃wrex 3134  ∃!wreu 3135  ∃*wrmo 3136 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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-10 2146  ax-11 2162  ax-12 2179 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clel 2896  df-ral 3138  df-rex 3139  df-reu 3140  df-rmo 3141 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator