let A be QC-alphabet ; :: thesis: for F being Element of QC-WFF A
for t, t9 being Element of dom (tree_of_subformulae F) st t is_a_proper_prefix_of t9 holds
(tree_of_subformulae F) . t9 <> (tree_of_subformulae F) . t
let F be Element of QC-WFF A; :: thesis: for t, t9 being Element of dom (tree_of_subformulae F) st t is_a_proper_prefix_of t9 holds
(tree_of_subformulae F) . t9 <> (tree_of_subformulae F) . t
let t, t9 be Element of dom (tree_of_subformulae F); :: thesis: ( t is_a_proper_prefix_of t9 implies (tree_of_subformulae F) . t9 <> (tree_of_subformulae F) . t )
set G = (tree_of_subformulae F) . t;
set H = (tree_of_subformulae F) . t9;
assume t is_a_proper_prefix_of t9 ; :: thesis: (tree_of_subformulae F) . t9 <> (tree_of_subformulae F) . t
then len (@ ((tree_of_subformulae F) . t9)) < len (@ ((tree_of_subformulae F) . t)) by Th14;
hence (tree_of_subformulae F) . t9 <> (tree_of_subformulae F) . t ; :: thesis: verum