Theorem inundifss 3301

Description: The intersection and class difference of a class with another class are contained in the original class. In classical logic we'd be able to make a stronger statement: that everything in the original class is in the intersection or the difference (that is, this theorem would be equality rather than subset). (Contributed by Jim Kingdon, 4-Aug-2018.)

Assertion

Ref	Expression
inundifss	|- ( ( A i^i B ) u. ( A \ B ) ) C_ A

Proof of Theorem inundifss

Step	Hyp	Ref	Expression
1		inss1 3157	. 2 |- ( A i^i B ) C_ A
2		difss 3070	. 2 |- ( A \ B ) C_ A
3	1, 2	unssi 3118	1 |- ( ( A i^i B ) u. ( A \ B ) ) C_ A

Syntax hints:   \ cdif 2914   u. cun 2915   i^i cin 2916   C_ wss 2917

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:  resasplitss  5069