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

Theorem ss2rexv 4029
Description: Two existential quantifications restricted to a subclass. (Contributed by AV, 11-Mar-2023.)
Assertion
Ref Expression
ss2rexv (𝐴𝐵 → (∃𝑥𝐴𝑦𝐴 𝜑 → ∃𝑥𝐵𝑦𝐵 𝜑))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑦,𝐴   𝑦,𝐵
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem ss2rexv
StepHypRef Expression
1 ssrexv 4027 . . 3 (𝐴𝐵 → (∃𝑦𝐴 𝜑 → ∃𝑦𝐵 𝜑))
21reximdv 3272 . 2 (𝐴𝐵 → (∃𝑥𝐴𝑦𝐴 𝜑 → ∃𝑥𝐴𝑦𝐵 𝜑))
3 ssrexv 4027 . 2 (𝐴𝐵 → (∃𝑥𝐴𝑦𝐵 𝜑 → ∃𝑥𝐵𝑦𝐵 𝜑))
42, 3syld 47 1 (𝐴𝐵 → (∃𝑥𝐴𝑦𝐴 𝜑 → ∃𝑥𝐵𝑦𝐵 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wrex 3138  wss 3929
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2799  df-cleq 2813  df-clel 2892  df-ral 3142  df-rex 3143  df-in 3936  df-ss 3945
This theorem is referenced by:  prpair  43737
  Copyright terms: Public domain W3C validator