The diagram you have drawn is for the set of languages which constitute recursive/recursively enumerable languages, which are called language families. Now L1, L2 and L3 are individual languages. So, the subset relation need not hold for them.
For example,
{{1},{2}} ⊂ {{1},{2},{3}}, but {1} ⊄ {2}
So, your second figure is not correct.