5

By definition of cardinality, $|X|=|Y|$ if there exists a bijective function $f:X\to Y$.
I would like to rigorously prove that if $A$ is a finite set, then $|A|\neq |A\cup B|$ when $B\not\subseteq A$. However, this seems less trivial than anticipated.
I must point out, the reason this is less tri...