theorem
  not m in dom p implies not m+1 in dom p
proof
  assume not m in dom p; then
A1: m >= card p by Lm1;
  m+1 >= m by NAT_1:11;
  hence thesis by Lm1,A1,XXREAL_0:2;
end;
