theorem takeeq1d (_G: wff) (_l1 _l2 n: nat): $ _G -> _l1 = _l2 $ > $ _G -> take _l1 n = take _l2 n $;
_G -> _l1 = _l2
_G -> n = n
_G -> take _l1 n = take _l2 n