reserve X for set;
reserve a,b,c,k,m,n for Nat;
reserve i for Integer;
reserve r for Real;
reserve p for Prime;

theorem Th8:
  2|^(12*n),1 are_congruent_mod 13
  proof
    defpred P[Nat] means 2|^(12*$1),1 are_congruent_mod 13;
A1: P[0]
    proof
      2|^(12*0) = 1 by NEWTON:4;
      hence 2|^(12*0),1 are_congruent_mod 13 by INT_1:11;
    end;
A2: for k st P[k] holds P[k+1]
    proof
      let k;
      assume
A3:   P[k];
A4:   12*(k+1) = 12*k+12*1;
      13*315 = 2|^12 - 1 by Lm6,Lm1107;
      then 2|^(12*1),1 are_congruent_mod 13;
      then 2|^(12*k)*2|^(12*1),1*1 are_congruent_mod 13 by A3,INT_1:18;
      hence 2|^(12*(k+1)),1 are_congruent_mod 13 by A4,NEWTON:8;
    end;
    P[k] from NAT_1:sch 2(A1,A2);
    hence thesis;
  end;
