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

Theorem 2reurex 3754
Description: Double restricted quantification with existential uniqueness, analogous to 2euex 2630. (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 3366 . 2 (∃!𝑥𝐴𝑦𝐵 𝜑 ↔ (∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∃*𝑥𝐴𝑦𝐵 𝜑))
2 rexcom 3278 . . . 4 (∃𝑥𝐴𝑦𝐵 𝜑 ↔ ∃𝑦𝐵𝑥𝐴 𝜑)
3 nfcv 2892 . . . . . 6 𝑦𝐴
4 nfre1 3273 . . . . . 6 𝑦𝑦𝐵 𝜑
53, 4nfrmow 3397 . . . . 5 𝑦∃*𝑥𝐴𝑦𝐵 𝜑
6 rspe 3237 . . . . . . . . . . 11 ((𝑦𝐵𝜑) → ∃𝑦𝐵 𝜑)
76ex 411 . . . . . . . . . 10 (𝑦𝐵 → (𝜑 → ∃𝑦𝐵 𝜑))
87ralrimivw 3140 . . . . . . . . 9 (𝑦𝐵 → ∀𝑥𝐴 (𝜑 → ∃𝑦𝐵 𝜑))
9 rmoim 3734 . . . . . . . . 9 (∀𝑥𝐴 (𝜑 → ∃𝑦𝐵 𝜑) → (∃*𝑥𝐴𝑦𝐵 𝜑 → ∃*𝑥𝐴 𝜑))
108, 9syl 17 . . . . . . . 8 (𝑦𝐵 → (∃*𝑥𝐴𝑦𝐵 𝜑 → ∃*𝑥𝐴 𝜑))
1110impcom 406 . . . . . . 7 ((∃*𝑥𝐴𝑦𝐵 𝜑𝑦𝐵) → ∃*𝑥𝐴 𝜑)
12 rmo5 3384 . . . . . . 7 (∃*𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑))
1311, 12sylib 217 . . . . . 6 ((∃*𝑥𝐴𝑦𝐵 𝜑𝑦𝐵) → (∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑))
1413ex 411 . . . . 5 (∃*𝑥𝐴𝑦𝐵 𝜑 → (𝑦𝐵 → (∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑)))
155, 14reximdai 3249 . . . 4 (∃*𝑥𝐴𝑦𝐵 𝜑 → (∃𝑦𝐵𝑥𝐴 𝜑 → ∃𝑦𝐵 ∃!𝑥𝐴 𝜑))
162, 15biimtrid 241 . . 3 (∃*𝑥𝐴𝑦𝐵 𝜑 → (∃𝑥𝐴𝑦𝐵 𝜑 → ∃𝑦𝐵 ∃!𝑥𝐴 𝜑))
1716impcom 406 . 2 ((∃𝑥𝐴𝑦𝐵 𝜑 ∧ ∃*𝑥𝐴𝑦𝐵 𝜑) → ∃𝑦𝐵 ∃!𝑥𝐴 𝜑)
181, 17sylbi 216 1 (∃!𝑥𝐴𝑦𝐵 𝜑 → ∃𝑦𝐵 ∃!𝑥𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 394  wcel 2099  wral 3051  wrex 3060  ∃!wreu 3362  ∃*wrmo 3363
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-10 2130  ax-11 2147  ax-12 2167
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-tru 1537  df-ex 1775  df-nf 1779  df-mo 2529  df-eu 2558  df-clel 2803  df-nfc 2878  df-ral 3052  df-rex 3061  df-rmo 3364  df-reu 3365
This theorem is referenced by:  2rexreu  3756
  Copyright terms: Public domain W3C validator
OSZAR »