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.
Prod = FOL +
types "*" 2 (infixl 20)
arities "*" :: (term,term)term
consts fst :: "'a * 'b => 'a"
snd :: "'a * 'b => 'b"
Pair :: "['a,'b] => 'a * 'b" ("(1<_,/_>)")
rules fst "fst(<a,b>) = a"
snd "snd(<a,b>) = b"
end