Tutorial/Minimal.thy
author Christian Urban <urbanc@in.tum.de>
Wed, 13 Apr 2011 13:41:52 +0100
changeset 2765 7ac5e5c86c7d
parent 2686 52e1e98edb34
child 3132 87eca760dcba
permissions -rw-r--r--
introduced framework for finetuning eqvt-rules; this solves problem with permute_pure called in nominal_inductive

theory Minimal
imports "Nominal2"
begin

atom_decl name

nominal_datatype lam =
  Var "name"
| App "lam" "lam"
| Lam x::"name" l::"lam"  bind x in l ("Lam [_]. _" [100, 100] 100)



lemma alpha_test:
  shows "Lam [x]. (Var x) = Lam [y]. (Var y)"
  by (simp add: lam.eq_iff Abs1_eq_iff lam.fresh fresh_at_base)

end