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

Theorem rexdifpr 3733
Description: Restricted existential quantification over a set with two elements removed. (Contributed by Alexander van der Vekens, 7-Feb-2018.)
Assertion
Ref Expression
rexdifpr  |-  ( E. x  e.  ( A 
\  { B ,  C } ) ph  <->  E. x  e.  A  ( x  =/=  B  /\  x  =/= 
C  /\  ph ) )

Proof of Theorem rexdifpr
StepHypRef Expression
1 eldifpr 3732 . . . . 5  |-  ( x  e.  ( A  \  { B ,  C }
)  <->  ( x  e.  A  /\  x  =/= 
B  /\  x  =/=  C ) )
2 3anass 1013 . . . . 5  |-  ( ( x  e.  A  /\  x  =/=  B  /\  x  =/=  C )  <->  ( x  e.  A  /\  (
x  =/=  B  /\  x  =/=  C ) ) )
31, 2bitri 184 . . . 4  |-  ( x  e.  ( A  \  { B ,  C }
)  <->  ( x  e.  A  /\  ( x  =/=  B  /\  x  =/=  C ) ) )
43anbi1i 462 . . 3  |-  ( ( x  e.  ( A 
\  { B ,  C } )  /\  ph ) 
<->  ( ( x  e.  A  /\  ( x  =/=  B  /\  x  =/=  C ) )  /\  ph ) )
5 anass 405 . . . 4  |-  ( ( ( x  e.  A  /\  ( x  =/=  B  /\  x  =/=  C
) )  /\  ph ) 
<->  ( x  e.  A  /\  ( ( x  =/= 
B  /\  x  =/=  C )  /\  ph )
) )
6 df-3an 1011 . . . . . 6  |-  ( ( x  =/=  B  /\  x  =/=  C  /\  ph ) 
<->  ( ( x  =/= 
B  /\  x  =/=  C )  /\  ph )
)
76bicomi 132 . . . . 5  |-  ( ( ( x  =/=  B  /\  x  =/=  C
)  /\  ph )  <->  ( x  =/=  B  /\  x  =/= 
C  /\  ph ) )
87anbi2i 461 . . . 4  |-  ( ( x  e.  A  /\  ( ( x  =/= 
B  /\  x  =/=  C )  /\  ph )
)  <->  ( x  e.  A  /\  ( x  =/=  B  /\  x  =/=  C  /\  ph )
) )
95, 8bitri 184 . . 3  |-  ( ( ( x  e.  A  /\  ( x  =/=  B  /\  x  =/=  C
) )  /\  ph ) 
<->  ( x  e.  A  /\  ( x  =/=  B  /\  x  =/=  C  /\  ph ) ) )
104, 9bitri 184 . 2  |-  ( ( x  e.  ( A 
\  { B ,  C } )  /\  ph ) 
<->  ( x  e.  A  /\  ( x  =/=  B  /\  x  =/=  C  /\  ph ) ) )
1110rexbii2 2561 1  |-  ( E. x  e.  ( A 
\  { B ,  C } ) ph  <->  E. x  e.  A  ( x  =/=  B  /\  x  =/= 
C  /\  ph ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    /\ w3a 1009    e. wcel 2209    =/= wne 2420   E.wrex 2529    \ cdif 3217   {cpr 3706
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-in1 623  ax-in2 624  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-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-sn 3711  df-pr 3712
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator