theory Abs

begin

(* lemmas that should be in Nominal \<dots>\<dots>must be cleaned *)

lemma in_permute_iff:

  shows "(p \<bullet> x) \<in> (p \<bullet> X) \<longleftrightarrow> x \<in> X"

apply(unfold mem_def permute_fun_def)[1]

apply(simp add: permute_bool_def) 

done

lemma fresh_star_permute_iff:

  shows "(p \<bullet> a) \<sharp>* (p \<bullet> x) \<longleftrightarrow> a \<sharp>* x"

apply(simp add: fresh_star_def)

apply(auto)

apply(drule_tac x="p \<bullet> xa" in bspec)

apply(unfold mem_def permute_fun_def)[1] 

apply(simp add: eqvts)

apply(simp add: fresh_permute_iff)

apply(rule_tac ?p1="- p" in fresh_permute_iff[THEN iffD1])

apply(simp)

apply(drule_tac x="- p \<bullet> xa" in bspec)

apply(rule_tac ?p1="p" in in_permute_iff[THEN iffD1])

apply(simp)

apply(simp)

done

fun

  alpha_gen 

where

  alpha_gen[simp del]:

  "(alpha_gen (bs, x) R f pi (cs, y)) \<longleftrightarrow> (f x - bs = f y - cs) \<and> ((f x - bs) \<sharp>* pi) \<and> (R (pi \<bullet> x) y)"

notation

  alpha_gen ("_ \<approx>gen _ _ _ _")

lemma [mono]: "R1 \<le> R2 \<Longrightarrow> alpha_gen x R1 \<le> alpha_gen x R2"

  by (cases x) (auto simp add: le_fun_def le_bool_def alpha_gen.simps)

lemma alpha_gen_refl:

  assumes a: "R x x"

  shows "(bs, x) \<approx>gen R f 0 (bs, x)"

  using a by (simp add: alpha_gen fresh_star_def fresh_zero_perm)

lemma alpha_gen_sym:

  assumes a: "(bs, x) \<approx>gen R f p (cs, y)"

  and     b: "R (p \<bullet> x) y \<Longrightarrow> R (- p \<bullet> y) x"

  shows "(cs, y) \<approx>gen R f (- p) (bs, x)"

  using a b by (simp add: alpha_gen fresh_star_def fresh_def supp_minus_perm)

lemma alpha_gen_trans:

  assumes a: "(bs, x) \<approx>gen R f p1 (cs, y)"

  and     b: "(cs, y) \<approx>gen R f p2 (ds, z)"

  and     c: "\<lbrakk>R (p1 \<bullet> x) y; R (p2 \<bullet> y) z\<rbrakk> \<Longrightarrow> R ((p2 + p1) \<bullet> x) z"

  shows "(bs, x) \<approx>gen R f (p2 + p1) (ds, z)"

  using a b c using supp_plus_perm

  apply(simp add: alpha_gen fresh_star_def fresh_def)

  apply(blast)

  done

lemma alpha_gen_eqvt:

  assumes a: "(bs, x) \<approx>gen R f q (cs, y)"

  and     b: "R (q \<bullet> x) y \<Longrightarrow> R (p \<bullet> (q \<bullet> x)) (p \<bullet> y)"

  and     c: "p \<bullet> (f x) = f (p \<bullet> x)"

  and     d: "p \<bullet> (f y) = f (p \<bullet> y)"

  shows "(p \<bullet> bs, p \<bullet> x) \<approx>gen R f (p \<bullet> q) (p \<bullet> cs, p \<bullet> y)"

  using a b

  apply(simp add: alpha_gen c[symmetric] d[symmetric] Diff_eqvt[symmetric])

  apply(simp add: permute_eqvt[symmetric])

  apply(simp add: fresh_star_permute_iff)

  apply(clarsimp)

  done

fun

where

notation

lemma test1:

  assumes a1: "a \<notin> (supp x) - bs"

  and     a2: "b \<notin> (supp x) - bs"

apply(simp)

apply(rule_tac x="(a \<rightleftharpoons> b)" in exI)

apply(simp add: alpha_gen)

apply(simp add: supp_eqvt[symmetric] Diff_eqvt[symmetric])

apply(simp add: swap_set_fresh[OF a1 a2])

apply(subgoal_tac "supp (a \<rightleftharpoons> b) \<subseteq> {a, b}")

using a1 a2

apply(simp add: fresh_star_def fresh_def)

apply(blast)

apply(simp add: supp_swap)

done

fun

  s_test

where

  "s_test (bs, x) = (supp x) - bs"

lemma s_test_lemma:

  shows "s_test x = s_test y"

using a

apply(simp add: alpha_gen)

done

  apply(rule equivpI)

  unfolding reflp_def symp_def transp_def

  apply(simp_all)

  apply(clarify)

  apply(rule exI)

  apply(rule alpha_gen_refl)

  apply(simp)

  apply(clarify)

  apply(rule exI)

  apply(rule alpha_gen_sym)

  apply(assumption)

  apply(clarsimp)

  apply(clarify)

  apply(rule exI)

  apply(rule alpha_gen_trans)

  apply(assumption)

  apply(assumption)

  apply(simp)

  done

quotient_definition

as

   "Pair::atom set \<Rightarrow> ('a::pt) \<Rightarrow> (atom set \<times> 'a)"

lemma [quot_respect]:

apply(clarsimp)

apply(rule exI)

apply(rule alpha_gen_refl)

apply(simp)

done

lemma [quot_respect]:

apply(clarsimp)

apply(rule exI)

apply(rule alpha_gen_eqvt)

apply(assumption)

apply(simp_all add: supp_eqvt)

done

lemma [quot_respect]:

apply(simp add: s_test_lemma)

done

apply(lifting prod.induct[where 'a="atom set" and 'b="'a"])

done

begin

quotient_definition

as

  "permute:: perm \<Rightarrow> (atom set \<times> 'a::pt) \<Rightarrow> (atom set \<times> 'a::pt)"

lemma permute_ABS [simp]:

  fixes x::"'a::pt"  (* ??? has to be 'a \<dots> 'b does not work *)

apply(lifting permute_prod.simps(1)[where 'a="atom set" and 'b="'a"])

done

instance

  apply(default)

  apply(simp_all)

  done

end

lemma test1_lifted:

  assumes a1: "a \<notin> (supp x) - bs"

  and     a2: "b \<notin> (supp x) - bs"

using a1 a2

apply(lifting test1)

done

unfolding supports_def

apply(clarify)

apply(simp (no_asm))

apply(subst test1_lifted[symmetric])

apply(simp_all)

done

quotient_definition

as

  "s_test"

lemma s_test_lifted_simp:

apply(lifting s_test.simps(1))

done

lemma s_test_lifted_eqvt:

  shows "(p \<bullet> (s_test_lifted ab)) = s_test_lifted (p \<bullet> ab)"

apply(simp add: s_test_lifted_simp supp_eqvt Diff_eqvt)

done

lemma fresh_f_empty_supp:

  assumes a: "\<forall>p. p \<bullet> f = f"

  shows "a \<sharp> x \<Longrightarrow> a \<sharp> (f x)"

apply(simp add: fresh_def)

apply(simp add: supp_def)

apply(simp add: permute_fun_app_eq)

apply(simp add: a)

apply(rule finite_subset)

prefer 2

apply(assumption)

apply(auto)

done

lemma s_test_fresh_lemma:

apply(rule fresh_f_empty_supp)

apply(rule allI)

apply(subst permute_fun_def)

apply(simp add: s_test_lifted_eqvt)

apply(simp)

done

lemma supp_finite_set:

  fixes S::"atom set"

  assumes "finite S"

  shows "supp S = S"

  apply(rule finite_supp_unique)

  apply(simp add: supports_def)

  apply(auto simp add: permute_set_eq swap_atom)[1]

  apply(metis)

  apply(rule assms)

  apply(auto simp add: permute_set_eq swap_atom)[1]

done

lemma s_test_subset:

  fixes x::"'a::fs"

apply(rule subsetI)

apply(rule contrapos_pp)

apply(assumption)

unfolding fresh_def[symmetric]

thm s_test_fresh_lemma

apply(drule_tac s_test_fresh_lemma)

apply(simp only: s_test_lifted_simp)

apply(simp add: fresh_def)

apply(subgoal_tac "finite (supp x - as)")

apply(simp add: supp_finite_set)

apply(simp add: finite_supp)

done

  fixes x::"'a::fs"

apply(rule subset_antisym)

apply(rule supp_is_subset)

apply(simp add: finite_supp)

apply(rule s_test_subset)

done

apply(default)

apply(simp add: finite_supp)

done

lemma fresh_abs:

  fixes x::"'a::fs"

apply(simp add: fresh_def)

apply(auto)

done

lemma abs_eq:

done

end