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

Theorem rexcom 2715
Description: Commutation of restricted quantifiers. (Contributed by NM, 19-Nov-1995.) (Revised by Mario Carneiro, 14-Oct-2016.)
Assertion
Ref Expression
rexcom  |-  ( E. x  e.  A  E. y  e.  B  ph  <->  E. y  e.  B  E. x  e.  A  ph )
Distinct variable groups:    x, y    x, B    y, A
Allowed substitution hints:    ph( x, y)    A( x)    B( y)

Proof of Theorem rexcom
StepHypRef Expression
1 nfcv 2392 . 2  |-  F/_ y A
2 nfcv 2392 . 2  |-  F/_ x B
31, 2rexcomf 2713 1  |-  ( E. x  e.  A  E. y  e.  B  ph  <->  E. y  e.  B  E. x  e.  A  ph )
Colors of variables: wff set class
Syntax hints:    <-> wb 105   E.wrex 2529
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534
This theorem is referenced by:  rexcom13  2717  rexcom4  2845  iuncom  4013  xpiundi  4828  addcomprg  7935  mulcomprg  7937  ltexprlemm  7957  caucvgprprlemexbt  8063  suplocexprlemml  8073  suplocexprlemmu  8075  qmulz  10002  elpq  10028  caubnd2  11861  sqrt2irr  12918  pythagtriplem19  13039
  Copyright terms: Public domain W3C validator