Let G be a connected graph and e1 and e2 be two edges of G. Prove that G-e1-e2 has three components iff both e1 and e1 are bridges.

I think I know how to prove it one way...if both e1 and e2 are bridges, then G-e1 is disconnected and the same for G-e2....So G-e1 produces two components, and G-e2 produces a third component..

I don't know how to prove in the other direction though.