reserve

  k,n,m,i,j for Element of NAT,
  K for Field;
reserve L for non empty addLoopStr;
reserve G for non empty multLoopStr;

theorem Th36:
  for m,i st 1<=i & i<=m holds |( Base_FinSeq(K,m,i),Base_FinSeq(K
  ,m,i) )|= 1.K
proof
  let m,i;
  assume
A1: 1<=i & i<=m;
  len (Base_FinSeq(K,m,i))=m by Th23;
  hence
  |( Base_FinSeq(K,m,i),Base_FinSeq(K,m,i) )| = (Base_FinSeq(K,m,i)).i by A1
,Th35
    .=1.K by A1,Th24;
end;
