reserve x for set,
  C for Ordinal,
  L0 for Sequence;
reserve O1,O2 for Ordinal;

theorem Th30:
  for A being non empty set for L be lower-bounded modular LATTICE
  for d be distance_function of A,L for S being ExtensionSeq2 of A,d for k,l
  being Nat st k <= l holds (S.k)`1 c= (S.l)`1
proof
  let A be non empty set;
  let L be lower-bounded modular LATTICE;
  let d be distance_function of A,L;
  let S be ExtensionSeq2 of A,d;
  let k be Nat;
  defpred X[Nat] means k <= $1 implies (S.k)`1 c= (S.$1)`1;
A1: for i being Nat st X[i] holds X[i+1]
  proof
    let i be Nat;
    assume that
A2: k <= i implies (S.k)`1 c= (S.i)`1 and
A3: k <= i+1;
    per cases by A3,NAT_1:8;
    suppose
      k = i+1;
      hence thesis;
    end;
    suppose
A4:   k <= i;
      consider A9 being non empty set, d9 being distance_function of A9,L, Aq
      being non empty set, dq being distance_function of Aq,L such that
A5:   Aq, dq is_extension2_of A9,d9 and
A6:   S.i = [A9,d9] and
A7:   S.(i+1) = [Aq,dq] by Def11;
A8:   (S.i)`1 c= ConsecutiveSet2(A9,DistEsti(d9)) by Th17,A6;
      ex q being QuadrSeq of d9 st Aq = NextSet2(d9) & dq = NextDelta2(q)
      by A5;
      then [Aq,dq]`1 = ConsecutiveSet2(A9,DistEsti(d9));
      hence thesis by A2,A4,A8,A7;
    end;
  end;
A9: X[0] by NAT_1:3;
  thus for l being Nat holds X[l] from NAT_1:sch 2(A9, A1);
end;
