theorem
  not F in W implies len(W\{F}) = len(W)
proof
  assume
A1: not F in W;
  consider L such that
A2: rng L = Subformulae H & L is one-to-one by FINSEQ_4:58;
  len(W\{F}) = len(L,W\{F}) by A2,Def26
    .= len(L,W) by A1,Th5;
  hence thesis by A2,Def26;
end;
