I'm so bad at solving the problem of the type:
"If $A$ is an NP-complete problem, $B$ is reducible to $A$, then $B$ is..."
That I have to come here and ask these silly questions each and every time I encounter them.
Is there a good way of using the Venn Diagram shown below to tackle these kind of problem?

For example, how can I prove that If $A$ is an NP-complete problem, $B$ is reducible to $A$, then $B$ can be NP-hard using the above diagram?
If not possible, what would be another way to drill this into my head?