ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  rexcom13 GIF version

Theorem rexcom13 2697
Description: Swap 1st and 3rd restricted existential quantifiers. (Contributed by NM, 8-Apr-2015.)
Assertion
Ref Expression
rexcom13 (∃𝑥𝐴𝑦𝐵𝑧𝐶 𝜑 ↔ ∃𝑧𝐶𝑦𝐵𝑥𝐴 𝜑)
Distinct variable groups:   𝑦,𝑧,𝐴   𝑥,𝑧,𝐵   𝑥,𝑦,𝐶
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝐴(𝑥)   𝐵(𝑦)   𝐶(𝑧)

Proof of Theorem rexcom13
StepHypRef Expression
1 rexcom 2695 . 2 (∃𝑥𝐴𝑦𝐵𝑧𝐶 𝜑 ↔ ∃𝑦𝐵𝑥𝐴𝑧𝐶 𝜑)
2 rexcom 2695 . . 3 (∃𝑥𝐴𝑧𝐶 𝜑 ↔ ∃𝑧𝐶𝑥𝐴 𝜑)
32rexbii 2537 . 2 (∃𝑦𝐵𝑥𝐴𝑧𝐶 𝜑 ↔ ∃𝑦𝐵𝑧𝐶𝑥𝐴 𝜑)
4 rexcom 2695 . 2 (∃𝑦𝐵𝑧𝐶𝑥𝐴 𝜑 ↔ ∃𝑧𝐶𝑦𝐵𝑥𝐴 𝜑)
51, 3, 43bitri 206 1 (∃𝑥𝐴𝑦𝐵𝑧𝐶 𝜑 ↔ ∃𝑧𝐶𝑦𝐵𝑥𝐴 𝜑)
Colors of variables: wff set class
Syntax hints:  wb 105  wrex 2509
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-cleq 2222  df-clel 2225  df-nfc 2361  df-rex 2514
This theorem is referenced by:  rexrot4  2698
  Copyright terms: Public domain W3C validator