Proving the inclusion exclusion principle from the definition of the cardinality

389 Views Asked by At

I want to prove the inclusion exclusion principle: $|A\cup B| = |A| + |B| - |A\cap B|$ where $A$ and $B$ are finite sets.

I proved the addition rule by contructing a bijection to a subset of the natural numbers and want to do the same here... Can you give me a hint, I don't want a full solution :)