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

Theorem rexdifpr 3620
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 3619 . . . . 5  |-  ( x  e.  ( A  \  { B ,  C }
)  <->  ( x  e.  A  /\  x  =/= 
B  /\  x  =/=  C ) )
2 3anass 982 . . . . 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 458 . . 3  |-  ( ( x  e.  ( A 
\  { B ,  C } )  /\  ph ) 
<->  ( ( x  e.  A  /\  ( x  =/=  B  /\  x  =/=  C ) )  /\  ph ) )
5 anass 401 . . . 4  |-  ( ( ( x  e.  A  /\  ( x  =/=  B  /\  x  =/=  C
) )  /\  ph ) 
<->  ( x  e.  A  /\  ( ( x  =/= 
B  /\  x  =/=  C )  /\  ph )
) )
6 df-3an 980 . . . . . 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 457 . . . 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 2488 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 978    e. wcel 2148    =/= wne 2347   E.wrex 2456    \ cdif 3126   {cpr 3593
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-rex 2461  df-v 2739  df-dif 3131  df-un 3133  df-sn 3598  df-pr 3599
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator