reserve n,k,b for Nat, i for Integer;

theorem Th36:
  101 is prime
  proof
    now
      let n be Element of NAT;
      101 = 2*50 + 1;
      then
      A1: not 2 divides 101 by NAT_4:9;
      101 = 3*33 + 2;
      then
      A2: not 3 divides 101 by NAT_4:9;
      101 = 5*20 + 1;
      then
      A3: not 5 divides 101 by NAT_4:9;
      101 = 7*14 + 3;
      then
      A4: not 7 divides 101 by NAT_4:9;
      101 = 11*9 + 2;
      then
      A5: not 11 divides 101 by NAT_4:9;
      101 = 13*7 + 10;
      then
      A6: not 13 divides 101 by NAT_4:9;
      101 = 17*5 + 16;
      then
      A7: not 17 divides 101 by NAT_4:9;
      101 = 19*5 + 6;
      then
      A8: not 19 divides 101 by NAT_4:9;
      101 = 23*4 + 9;
      then
      A9: not 23 divides 101 by NAT_4:9;
      assume 1<n & n*n<=101 & n is prime;
      hence not n divides 101 by A1,A2,A3,A4,A5,A6,A7,A8,A9,NAT_4:62;
    end;
    hence thesis by NAT_4:14;
  end;
