reserve n for non zero Nat,
  j,k,l,m for Nat,
  g,h,i for Integer;

theorem
  m >= 1 implies MajP(m, 1) = m
proof
  assume m >= 1;
  then
A1: 2 to_power m >= 1 by POWER:35;
  for k be Nat st 2 to_power k >= 1 & k >= m holds k >= m;
  hence thesis by A1,Def1;
end;
