A is Uncountable and B is Countable. Does $\left | A \right | = \left | A \cup B \right |$ ?
I was thinking build a countable set of distinct ordered elements $A_{N}= \left \{ \right. a_{N}: N\epsilon \mathbb{N}\left. \right \} $ where $A_{N}\subset{A}$.
Then define $ f: A_{N}\rightarrow{B}, f(a_{N})=b_{N}$.
Next define $ f: A\setminus A_{N}\rightarrow{A}, f(a_{n})=a_{n-N},\forall n>N$.
So we have two bijections and thus by taking the union $\left |A_{N} \cup A\setminus A_{N}\right | = \left | {B}\cup A \right | $.
Does this work out?