I'll show a proof if the two functions differ for only one point. Then, you can repeat the same argument in the neighbourhood of every other point.
So, suppose that we have
![f:[a,b]\to R,\quad g:[a,b]\to R,\quad \begin{cases} f(x) = g(x) &\text{ if } x\\eq x_0\\ f(x_0)\\eq g(x_0) \end{cases}](https://img.qammunity.org/2019/formulas/mathematics/high-school/c9ohrgvxso7gm7hk8scnuttlowqbtl7cv7.png)
We can write

We can write the exact same thing for
, and we have (as far as we know)

So, we only need to prove that the term where f and g are not the same function can be made arbitrarily small.
Since f and g are integrable on an interval, they are bounded. Let's call
and
the maximum of f and g, respectively, in the interval
. We have

The same goes for g(x). So, You have

which tends to 0 as
