doc-src/Tutorial/Recdef/gcd

proof by cases and induction on types and sets (used to be specific for HOL);

recdef gcd "measure (%(m,n).n)"
  simpset "simpset() addsimps [mod_less_divisor]"
  "gcd (m, n) = (if n=0 then m else gcd(n, m mod n))"