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

Theorem 2reurex 3721
Description: Double restricted quantification with existential uniqueness, analogous to 2euex 2669. (Contributed by Alexander van der Vekens, 24-Jun-2017.)
Assertion
Ref Expression
2reurex (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∃𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑)
Distinct variable groups:   𝑦,𝐴   𝑥,𝑦   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem 2reurex
StepHypRef Expression
1 reu5 3371 . 2 (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑))
2 rexcom 3295 . . . 4 (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑)
3 nfcv 2926 . . . . . 6 Ⅎ𝑦𝐴
4 nfre1 3291 . . . . . 6 Ⅎ𝑦∃𝑦 ∈ 𝐵 𝜑
53, 4nfrmow 3398 . . . . 5 Ⅎ𝑦∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑
6 rspe 3256 . . . . . . . . . . 11 ((𝑦 ∈ 𝐵 ∧ 𝜑) → ∃𝑦 ∈ 𝐵 𝜑)
76ex 418 . . . . . . . . . 10 (𝑦 ∈ 𝐵 → (𝜑 → ∃𝑦 ∈ 𝐵 𝜑))
87ralrimivw 3162 . . . . . . . . 9 (𝑦 ∈ 𝐵 → ∀𝑥 ∈ 𝐴 (𝜑 → ∃𝑦 ∈ 𝐵 𝜑))
9 rmoim 3701 . . . . . . . . 9 (∀𝑥 ∈ 𝐴 (𝜑 → ∃𝑦 ∈ 𝐵 𝜑) → (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∃*𝑥 ∈ 𝐴 𝜑))
108, 9syl 18 . . . . . . . 8 (𝑦 ∈ 𝐵 → (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∃*𝑥 ∈ 𝐴 𝜑))
1110impcom 413 . . . . . . 7 ((∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ 𝑦 ∈ 𝐵) → ∃*𝑥 ∈ 𝐴 𝜑)
12 rmo5 3387 . . . . . . 7 (∃*𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 → ∃!𝑥 ∈ 𝐴 𝜑))
1311, 12sylib 221 . . . . . 6 ((∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ 𝑦 ∈ 𝐵) → (∃𝑥 ∈ 𝐴 𝜑 → ∃!𝑥 ∈ 𝐴 𝜑))
1413ex 418 . . . . 5 (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → (𝑦 ∈ 𝐵 → (∃𝑥 ∈ 𝐴 𝜑 → ∃!𝑥 ∈ 𝐴 𝜑)))
155, 14reximdai 3268 . . . 4 (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → (∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑))
162, 15biimtrid 245 . . 3 (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∃𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑))
1716impcom 413 . 2 ((∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑) → ∃𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑)
181, 17sylbi 220 1 (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∃𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ∃!wreu 3367  ∃*wrmo 3368
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-10 2180  ax-11 2197  ax-12 2216
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 2567  df-eu 2597  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370
This theorem is used by:  2rexreu  3723
  Copyright terms: Public domain W3C validator