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

Theorem undifabs 3300
Description: Absorption of difference by union. (Contributed by NM, 18-Aug-2013.)
Assertion
Ref Expression
undifabs  |-  ( A  u.  ( A  \  B ) )  =  A

Proof of Theorem undifabs
StepHypRef Expression
1 ssid 2964 . . 3  |-  A  C_  A
2 difss 3070 . . 3  |-  ( A 
\  B )  C_  A
31, 2unssi 3118 . 2  |-  ( A  u.  ( A  \  B ) )  C_  A
4 ssun1 3106 . 2  |-  A  C_  ( A  u.  ( A  \  B ) )
53, 4eqssi 2961 1  |-  ( A  u.  ( A  \  B ) )  =  A
Colors of variables: wff set class
Syntax hints:    = wceq 1243    \ cdif 2914    u. cun 2915
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator