reserve x,y, X,Y,Z for set,
        D for non empty set,
        n,k for Nat,
        i,i1,i2 for Integer;
reserve K for SimplicialComplexStr;
reserve KX for SimplicialComplexStr of X,
        SX for SubSimplicialComplex of KX;
reserve SC for SimplicialComplex of X;
reserve K for non void subset-closed SimplicialComplexStr;
reserve P for Function;

theorem
  [#]subdivision(n,P,KX) = [#]KX
 proof
  defpred P[Nat] means
   [#]subdivision($1,P,KX)=[#]KX;
  A1: for n st P[n] holds P[n+1]
  proof
   let n;
   n in NAT by ORDINAL1:def 12;
   then A2: subdivision(n+1,P,KX)=subdivision(1,P,subdivision(n,P,KX)) by Th63
    .=subdivision(P,subdivision(n,P,KX)) by Th62;
   assume[#]subdivision(n,P,KX)=[#]KX;
   hence thesis by A2,Def20;
  end;
  A3: P[0 qua Nat] by Th61;
  for n holds P[n] from NAT_1:sch 2(A3,A1);
  hence thesis;
 end;
