It's very simple to prove. Prove it by contradiction.
Let consider, there is a connected graph G, which has no circuit.
The above statement implies that graph G is a Tree.
And from the tree if you remove any edge, it makes Tree disconnected.
Hence Graph G to be connected after removing an edge $ e_i $, $ e_i $ must be the part of some circuit.
