let A be QC-alphabet ; :: thesis: for F, H being Element of QC-WFF A
for t being Element of dom (tree_of_subformulae F) holds
( H is_immediate_constituent_of (tree_of_subformulae F) . t iff ex n being Nat st
( t ^ <*n*> in dom (tree_of_subformulae F) & H = (tree_of_subformulae F) . (t ^ <*n*>) ) )

let F, H be Element of QC-WFF A; :: thesis: for t being Element of dom (tree_of_subformulae F) holds
( H is_immediate_constituent_of (tree_of_subformulae F) . t iff ex n being Nat st
( t ^ <*n*> in dom (tree_of_subformulae F) & H = (tree_of_subformulae F) . (t ^ <*n*>) ) )

let t be Element of dom (tree_of_subformulae F); :: thesis: ( H is_immediate_constituent_of (tree_of_subformulae F) . t iff ex n being Nat st
( t ^ <*n*> in dom (tree_of_subformulae F) & H = (tree_of_subformulae F) . (t ^ <*n*>) ) )

now :: thesis: ( H is_immediate_constituent_of (tree_of_subformulae F) . t implies ex n being Nat st
( t ^ <*n*> in dom (tree_of_subformulae F) & H = (tree_of_subformulae F) . (t ^ <*n*>) ) )
end;
hence ( H is_immediate_constituent_of (tree_of_subformulae F) . t implies ex n being Nat st
( t ^ <*n*> in dom (tree_of_subformulae F) & H = (tree_of_subformulae F) . (t ^ <*n*>) ) ) ; :: thesis: ( ex n being Nat st
( t ^ <*n*> in dom (tree_of_subformulae F) & H = (tree_of_subformulae F) . (t ^ <*n*>) ) implies H is_immediate_constituent_of (tree_of_subformulae F) . t )

given n being Nat such that A4: t ^ <*n*> in dom (tree_of_subformulae F) and
A5: H = (tree_of_subformulae F) . (t ^ <*n*>) ; :: thesis: H is_immediate_constituent_of (tree_of_subformulae F) . t
ex G being Element of QC-WFF A st
( G = (tree_of_subformulae F) . (t ^ <*n*>) & G is_immediate_constituent_of (tree_of_subformulae F) . t ) by A4, Th6;
hence H is_immediate_constituent_of (tree_of_subformulae F) . t by A5; :: thesis: verum