let H be LTL-formula; :: thesis: for W being Subset of (Subformulae H) holds len W >= 0
let W be Subset of (Subformulae H); :: thesis: len W >= 0
now :: thesis: len W >= 0
per cases ( W = {} H or W <> {} H ) ;
end;
end;
hence len W >= 0 ; :: thesis: verum