Let G be a connected graph and B, B0 be two bonds in G. Show that (B ∪ B0 ) − e contains a bond for any edge e of G.

(Suggested approach: Show that the symmetric difference B4B0 is an edge cut, which must be a disjoint union of bonds.)