let F, H be LTL-formula; :: thesis: ( F is_proper_subformula_of 'not' H implies F is_subformula_of H )
assume A1: F is_proper_subformula_of 'not' H ; :: thesis: F is_subformula_of H
A2: 'not' H is negative by Def15;
then the_argument_of ('not' H) = H by Def21;
hence F is_subformula_of H by A1, A2, Th123; :: thesis: verum