Explaining regular expressions
You have to show two things:


Every word in the language of your regular expression contains 101 as a substring.
Every word containing 101 as a substring belongs to the language of your regular expression.


You can prove both of these using the definition of the language of a regular expression. It is a bit tiring but otherwise requires little creativity.