Hi could you please help me with this question?

Its about proving the languages in computer science

Thanks

1. Let L1, L2, and L be nonempty languages. Prove the following. i) If Li C L2 then min{\x] : & Li} > min{\y\ : Y E L2}. ii) L2 C L if and only if L = L+