The new asm_lr_simp_tac is the old asm_full_simp_tac.
The new asm_full_simp_tac also does a limited amount of mutual simplification.
Arith = FOL +
classes arith < term
consts "0" :: "'a::arith" ("0")
"1" :: "'a::arith" ("1")
"+" :: "['a::arith,'a] => 'a" (infixl 60)
end