reserve k,n,n1,m,m1,m0,h,i,j for Nat,
  a,x,y,X,X1,X2,X3,X4,Y for set;
reserve L,L1,L2 for FinSequence;
reserve F,F1,G,G1,H for LTL-formula;
reserve W,W1,W2 for Subset of Subformulae H;
reserve v for LTL-formula;
reserve N,N1,N2,N10,N20,M for strict LTLnode over v;
reserve w for Element of Inf_seq(AtomicFamily);
reserve R1,R2 for Real_Sequence;

theorem Th7:
  rng L = Subformulae H & L is one-to-one & (not F in W) & W1 = W
  \/ {F} implies len(L,W1) = len(L,W) + len F
proof
  assume that
A1: rng L = Subformulae H & L is one-to-one and
A2: not F in W and
A3: W1 = W \/ {F};
A4: for x being object holds x in W1\{F} implies x in W
  proof let x be object;
    assume x in W1\{F};
    then x in W1 & not x in {F} by XBOOLE_0:def 5;
    hence thesis by A3,XBOOLE_0:def 3;
  end;
  for x being object holds x in W implies x in W1\{F}
  proof let x be object;
    assume x in W;
    then (not x in {F})& x in W1 by A2,A3,TARSKI:def 1,XBOOLE_0:def 3;
    hence thesis by XBOOLE_0:def 5;
  end;
  then
A5: W1\{F} = W by A4,TARSKI:2;
  F in {F} by TARSKI:def 1;
  then F in W1 by A3,XBOOLE_0:def 3;
  then len(L,W) = len(L,W1) - len F by A1,A5,Th6;
  hence thesis;
end;
