  We introduce a proper display calculus for first-order logic, of which we
prove soundness, completeness, conservativity, subformula property and cut
elimination via a Belnap-style metatheorem. All inference rules are closed
under uniform substitution and are without side conditions.
