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

Theorem difrab 3433
Description: Difference of two restricted class abstractions. (Contributed by NM, 23-Oct-2004.)
Assertion
Ref Expression
difrab  |-  ( { x  e.  A  |  ph }  \  { x  e.  A  |  ps } )  =  {
x  e.  A  | 
( ph  /\  -.  ps ) }

Proof of Theorem difrab
StepHypRef Expression
1 df-rab 2481 . . 3  |-  { x  e.  A  |  ph }  =  { x  |  ( x  e.  A  /\  ph ) }
2 df-rab 2481 . . 3  |-  { x  e.  A  |  ps }  =  { x  |  ( x  e.  A  /\  ps ) }
31, 2difeq12i 3275 . 2  |-  ( { x  e.  A  |  ph }  \  { x  e.  A  |  ps } )  =  ( { x  |  ( x  e.  A  /\  ph ) }  \  {
x  |  ( x  e.  A  /\  ps ) } )
4 df-rab 2481 . . 3  |-  { x  e.  A  |  ( ph  /\  -.  ps ) }  =  { x  |  ( x  e.  A  /\  ( ph  /\ 
-.  ps ) ) }
5 difab 3428 . . . 4  |-  ( { x  |  ( x  e.  A  /\  ph ) }  \  { x  |  ( x  e.  A  /\  ps ) } )  =  {
x  |  ( ( x  e.  A  /\  ph )  /\  -.  (
x  e.  A  /\  ps ) ) }
6 anass 401 . . . . . 6  |-  ( ( ( x  e.  A  /\  ph )  /\  -.  ps )  <->  ( x  e.  A  /\  ( ph  /\ 
-.  ps ) ) )
7 simpr 110 . . . . . . . . 9  |-  ( ( x  e.  A  /\  ps )  ->  ps )
87con3i 633 . . . . . . . 8  |-  ( -. 
ps  ->  -.  ( x  e.  A  /\  ps )
)
98anim2i 342 . . . . . . 7  |-  ( ( ( x  e.  A  /\  ph )  /\  -.  ps )  ->  ( ( x  e.  A  /\  ph )  /\  -.  (
x  e.  A  /\  ps ) ) )
10 pm3.2 139 . . . . . . . . . 10  |-  ( x  e.  A  ->  ( ps  ->  ( x  e.  A  /\  ps )
) )
1110adantr 276 . . . . . . . . 9  |-  ( ( x  e.  A  /\  ph )  ->  ( ps  ->  ( x  e.  A  /\  ps ) ) )
1211con3d 632 . . . . . . . 8  |-  ( ( x  e.  A  /\  ph )  ->  ( -.  ( x  e.  A  /\  ps )  ->  -.  ps ) )
1312imdistani 445 . . . . . . 7  |-  ( ( ( x  e.  A  /\  ph )  /\  -.  ( x  e.  A  /\  ps ) )  -> 
( ( x  e.  A  /\  ph )  /\  -.  ps ) )
149, 13impbii 126 . . . . . 6  |-  ( ( ( x  e.  A  /\  ph )  /\  -.  ps )  <->  ( ( x  e.  A  /\  ph )  /\  -.  ( x  e.  A  /\  ps ) ) )
156, 14bitr3i 186 . . . . 5  |-  ( ( x  e.  A  /\  ( ph  /\  -.  ps ) )  <->  ( (
x  e.  A  /\  ph )  /\  -.  (
x  e.  A  /\  ps ) ) )
1615abbii 2309 . . . 4  |-  { x  |  ( x  e.  A  /\  ( ph  /\ 
-.  ps ) ) }  =  { x  |  ( ( x  e.  A  /\  ph )  /\  -.  ( x  e.  A  /\  ps )
) }
175, 16eqtr4i 2217 . . 3  |-  ( { x  |  ( x  e.  A  /\  ph ) }  \  { x  |  ( x  e.  A  /\  ps ) } )  =  {
x  |  ( x  e.  A  /\  ( ph  /\  -.  ps )
) }
184, 17eqtr4i 2217 . 2  |-  { x  e.  A  |  ( ph  /\  -.  ps ) }  =  ( {
x  |  ( x  e.  A  /\  ph ) }  \  { x  |  ( x  e.  A  /\  ps ) } )
193, 18eqtr4i 2217 1  |-  ( { x  e.  A  |  ph }  \  { x  e.  A  |  ps } )  =  {
x  e.  A  | 
( ph  /\  -.  ps ) }
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2164   {cab 2179   {crab 2476    \ cdif 3150
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rab 2481  df-v 2762  df-dif 3155
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator