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

Theorem rexrot4 3103
Description: Rotate four restricted existential quantifiers twice. (Contributed by NM, 8-Apr-2015.)
Assertion
Ref Expression
rexrot4 (∃𝑥𝐴𝑦𝐵𝑧𝐶𝑤𝐷 𝜑 ↔ ∃𝑧𝐶𝑤𝐷𝑥𝐴𝑦𝐵 𝜑)
Distinct variable groups:   𝑧,𝑤,𝐴   𝑤,𝐵,𝑧   𝑥,𝑤,𝑦,𝐶   𝑥,𝑧,𝐷,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝐶(𝑧)   𝐷(𝑤)

Proof of Theorem rexrot4
StepHypRef Expression
1 rexcom13 3101 . . 3 (∃𝑦𝐵𝑧𝐶𝑤𝐷 𝜑 ↔ ∃𝑤𝐷𝑧𝐶𝑦𝐵 𝜑)
21rexbii 3041 . 2 (∃𝑥𝐴𝑦𝐵𝑧𝐶𝑤𝐷 𝜑 ↔ ∃𝑥𝐴𝑤𝐷𝑧𝐶𝑦𝐵 𝜑)
3 rexcom13 3101 . 2 (∃𝑥𝐴𝑤𝐷𝑧𝐶𝑦𝐵 𝜑 ↔ ∃𝑧𝐶𝑤𝐷𝑥𝐴𝑦𝐵 𝜑)
42, 3bitri 264 1 (∃𝑥𝐴𝑦𝐵𝑧𝐶𝑤𝐷 𝜑 ↔ ∃𝑧𝐶𝑤𝐷𝑥𝐴𝑦𝐵 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wb 196  wrex 2913
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918
This theorem is referenced by:  lsmspsn  19084
  Copyright terms: Public domain W3C validator