Equality saturation is an automatic rewrite technique with applications ranging from theorem proving to program optimization. It relies on the e-graph data structure, which compactly represents many equivalent terms. A significant bottleneck in equality saturation is unbounded and exponential e-graph growth. Destructive e-graph rewrites present a promising mitigation. Any rewrite rule can be made destructive by e-matching the left hand side and removing matches corresponding to the right hand side, rather than applying those matches. Applying destructive rewrites in egg, a state-of-the-art library for equality saturation, demonstrates up to 3x speed-ups and solves benchmarks that otherwise exceed the e-node limit.