A simplified lower bound for implicational logic

A streamlined and simplified exponential lower bound on the length of proofs in intuitionistic implicational logic will be presented. The construction suffices to be adaptated to Gordeev and Haeusler’s dag-like natural deduction.