Tutorial/Minimal.thy
author Cezary Kaliszyk <kaliszyk@in.tum.de>
Tue, 31 May 2011 12:54:21 +0900
changeset 2791 5d0875b7ed3e
parent 2686 52e1e98edb34
child 3132 87eca760dcba
permissions -rw-r--r--
Simple eqvt proofs with perm_simps for clarity

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