src/LCF/ex/Ex3.thy

more Isar proof methods;

section {* Addition with fixpoint of successor *}

theory Ex3
imports LCF
begin

axiomatization
  s     :: "'a => 'a" and
  p     :: "'a => 'a => 'a"
where
  p_strict:     "p(UU) = UU" and
  p_s:          "p(s(x),y) = s(p(x,y))"

declare p_strict [simp] p_s [simp]

lemma example: "p(FIX(s),y) = FIX(s)"
  apply (induct s)
  apply simp
  apply simp
  done

end