Distributivity of intersections across unions

Stub grade: D

This page is a stub

This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:

Created for use with the ring of sets generated by a semi-ring is the set containing the semi-ring and all finite disjoint unions, the theorem is easy and routine, at least in the finite cases

Statement

1. $A\cap(B\cup C)=(A\cap B)\cup(A\cap C)$
2. $A\cap(\bigcup_{i=1}^n B_i)=\bigcup_{i=1}^n(A\cap B_i)$ - Easy to do, use induction

Proof

Grade: C

This page requires one or more proofs to be filled in, it is on a to-do list for being expanded with them.

Please note that this does not mean the content is unreliable. Unless there are any caveats mentioned below the statement comes from a reliable source. As always, Warnings and limitations will be clearly shown and possibly highlighted if very important (see template:Caution et al).
The message provided is:

First one is routine chapter-1 for first-years, second one is easy using induction

This proof has been marked as an page requiring an easy proof

See also

• Distributivity of unions across intersections (almost the same: $A\cup(B\cap C)=(A\cup B)\cap(A\cup C)$)