  We provide a simple proof of a curious inequality for the binary entropy
function, an inequality that has been used in two different contexts. In the
1980's, Boppana used this entropy inequality to prove lower bounds on Boolean
formulas. More recently, the inequality was used to achieve major progress on
Frankl's union-closed sets conjecture. Our proof of the entropy inequality uses
basic differential calculus.
