anchor.diff:  
   let DIVMOD_EXIST_0 = 
       prove
  -        ((parse_term @"!m n. ?q r. if n = 0 |>THEN<| q = 0 /\ r = m
  +        ((parse_term @"!m n. ?q r. if n = 0 then q = 0 /\ r = m
                   else m = q * n + r /\ r < n"),
            REPEAT GEN_TAC
            |> THEN <| ASM_CASES_TAC(parse_term @"n = 0")
  
positive.code: 
  let LE_EXP = 
      prove((parse_term @"!x m n. x EXP m <= x EXP n <=>
              if x = 0 |>THEN<| (m = 0) ==> (n = 0)
              else (x = 1) \/ m <= n"),
       REPEAT GEN_TAC
             |> THEN <| REWRITE_TAC [GSYM NOT_LT
  
negative.code: 
  Copyright 1998 University of Cambridge
  Copyright 1998-2007 John Harrison
  Copyright 2013 Jack Pappas, Eric Taucher, Domenico Masini
  
  Licensed under the Apache License, Version 2.0 (the "License");
  you may not use this file except in compliance with the License.
  