anchor.diff:  	    "             => 14 modF -(5) = -(1) "
   	    "                => 11 modF -(5) = -(4) "
   	    "                   => -(14) modF -(5) = -(4) => -(5) ~= 0"
  -	    " "
  +	    (:optional "")
   	    " theorem Integer.modF_examples is "
   	    "    14 modF 5 = 4 "
   	    "    && 11 modF 5 = 1 "
  
positive.code: 	    "          => -(11) modR 5 = -(1) "
  	    "             => 14 modR -(5) = -(1) "
  	    "                => 11 modR -(5) = 1 => -(14) modR -(5) = 1 => -(5) ~= 0"
  	    " "
  	    " theorem Integer.modR_examples is "
  	    "    14 modR 5 = -(1) "
  	    "    && 11 modR 5 = 1 "
  
negative.code: 	    "   apply(rule zlcm_least, simp_all)"
  	    "   apply(rule dvd_antisym, simp_all, rule zlcm_geq_zero, rule zlcm_least, simp_all)"
  	    "  end-proof"
  	    (:optional "")
  	    " proof Isa lcm_subtype_constr"
  	    "  apply(induct dom_lcm, simp add: split_paired_all)"
  	    "  apply(rule_tac  Q=\"\\<lambda>z. z\\<ge>0\" and a=\"zlcm(a,b)\" in theI2, safe)  "
  