imports "Nominal2_Atoms" "Nominal2_Eqvt" "Nominal2_Supp" "../QuotMain" "Abs" "../QuotProd"

(* 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

lemma fresh_plus:

  fixes p q::perm

  shows "\<lbrakk>a \<sharp> p;  a \<sharp> q\<rbrakk> \<Longrightarrow> a \<sharp> (p + q)"

unfolding fresh_def

using supp_plus_perm

apply(auto)

done

lemma fresh_star_plus:

  fixes p q::perm

  shows "\<lbrakk>a \<sharp>* p;  a \<sharp>* q\<rbrakk> \<Longrightarrow> a \<sharp>* (p + q)"

unfolding fresh_star_def

by (simp add: fresh_plus)

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

  rfv :: "rlam \<Rightarrow> atom set"

  rfv_var: "rfv (rVar a) = {atom a}"

| rfv_lam: "rfv (rLam a t) = (rfv t) - {atom a}"

instantiation rlam :: pt

primrec

  permute_rlam

  "permute_rlam pi (rVar a) = rVar (pi \<bullet> a)"

| "permute_rlam pi (rApp t1 t2) = rApp (permute_rlam pi t1) (permute_rlam pi t2)"

| "permute_rlam pi (rLam a t) = rLam (pi \<bullet> a) (permute_rlam pi t)"

instance

apply default

apply(induct_tac [!] x)

apply(simp_all)

done

instantiation rlam :: fs

begin

lemma neg_conj:

  "\<not>(P \<and> Q) \<longleftrightarrow> (\<not>P) \<or> (\<not>Q)"

  by simp

lemma infinite_Un:

  "infinite (S \<union> T) \<longleftrightarrow> infinite S \<or> infinite T"

  by simp

instance

apply default

apply(induct_tac x)

(* var case *)

apply(simp add: supp_def)

apply(fold supp_def)[1]

apply(simp add: supp_at_base)

(* app case *)

apply(simp only: supp_def)

apply(simp only: permute_rlam.simps) 

apply(simp only: rlam.inject) 

apply(simp only: neg_conj)

apply(simp only: Collect_disj_eq)

apply(simp only: infinite_Un)

apply(simp only: Collect_disj_eq)

apply(simp)

(* lam case *)

apply(simp only: supp_def)

apply(simp only: permute_rlam.simps) 

apply(simp only: rlam.inject) 

apply(simp only: neg_conj)

apply(simp only: Collect_disj_eq)

apply(simp only: infinite_Un)

apply(simp only: Collect_disj_eq)

apply(simp)

apply(fold supp_def)[1]

apply(simp add: supp_at_base)

done

end

(* for the eqvt proof of the alpha-equivalence *)

declare permute_rlam.simps[eqvt]

apply(simp add: permute_set_eq atom_eqvt)

apply(simp add: Diff_eqvt)

apply(simp add: permute_set_eq atom_eqvt)

| a3: "\<exists>pi. (({atom a}, t) \<approx>gen alpha rfv pi ({atom b}, s)) \<Longrightarrow> rLam a t \<approx> rLam b s"

thm alpha.induct

lemma a3_inverse:

  assumes "rLam a t \<approx> rLam b s"

  shows "\<exists>pi. (({atom a}, t) \<approx>gen alpha rfv pi ({atom b}, s))"

using assms

apply(erule_tac alpha.cases)

apply(auto)

done

text {* should be automatic with new version of eqvt-machinery *}

apply(simp add: alpha_gen.simps)

apply(erule conjE)+

apply(rule conjI)+

apply(rule_tac ?p1="- pi" in permute_eq_iff[THEN iffD1])

apply(simp add: eqvts atom_eqvt)

apply(rule_tac ?p1="- pi" in fresh_star_permute_iff[THEN iffD1])

apply(simp add: eqvts atom_eqvt)

apply(subst permute_eqvt[symmetric])

apply(rule_tac x="0" in exI)

apply(rule alpha_gen_refl)

apply(assumption)

lemma fresh_minus_perm:

  fixes p::perm

  shows "a \<sharp> (- p) \<longleftrightarrow> a \<sharp> p"

  apply(simp add: fresh_def)

  apply(simp only: supp_minus_perm)

  done

lemma alpha_gen_atom_sym:

  assumes a: "\<And>pi t s. (R t s \<Longrightarrow> R (pi \<bullet> t) (pi \<bullet> s))"

  shows "\<exists>pi. ({atom a}, t) \<approx>gen \<lambda>x1 x2. R x1 x2 \<and> R x2 x1 f pi ({atom b}, s) \<Longrightarrow>

       \<exists>pi. ({atom b}, s) \<approx>gen R f pi ({atom a}, t)"

  apply(erule exE)

  apply(rule_tac x="- pi" in exI)

  apply(simp add: alpha_gen.simps)

  apply(erule conjE)+

  apply(rule conjI)

  apply(simp add: fresh_star_def fresh_minus_perm)

  apply(subgoal_tac "R (- pi \<bullet> s) ((- pi) \<bullet> (pi \<bullet> t))")

  apply simp

  apply(rule a)

  apply assumption

  done

  apply(induct rule: alpha.induct)

  apply(simp add: a1)

  apply(simp add: a2)

  apply(rule a3)

  apply(rule alpha_gen_atom_sym)

  apply(rule alpha_eqvt)

  apply(assumption)+

  done

apply(simp add: alpha_gen.simps)

apply(rule_tac x="pia + pi" in exI)

apply(simp add: alpha_gen.simps)

apply(simp add: fresh_star_plus)

apply(drule_tac x="- pia \<bullet> sa" in spec)

apply(rotate_tac 7)

apply(drule_tac pi="- pia" in alpha_eqvt)

apply(simp)

apply(rotate_tac 9)

apply(simp)

  apply(rule equivpI)

  unfolding reflp_def symp_def transp_def

  apply(auto intro: alpha_refl alpha_sym alpha_trans)

  done

  apply(induct rule: alpha.induct)

  apply(simp_all add: alpha_gen.simps)

  done

  "fv :: lam \<Rightarrow> atom set"

  "(op = ===> alpha ===> alpha) permute permute"

  apply(rule alpha_eqvt)

  apply(simp)

  done

lemma rApp_rsp[quot_respect]: 

  "(alpha ===> alpha ===> alpha) rApp rApp"

lemma rLam_rsp[quot_respect]: 

  "(op = ===> alpha ===> alpha) rLam rLam"

  apply(rule_tac x="0" in exI)

  unfolding fresh_star_def 

  apply(simp add: fresh_star_def fresh_zero_perm alpha_gen.simps)

  apply (lifting rlam.induct)

  done

instantiation lam :: pt

begin

quotient_definition

  "permute_lam :: perm \<Rightarrow> lam \<Rightarrow> lam"

as

  "permute :: perm \<Rightarrow> rlam \<Rightarrow> rlam"

lemma permute_lam [simp]:

apply(lifting permute_rlam.simps)

instance

apply default

apply(simp_all)

end

  shows "fv (Var a) = {atom a}"

  and   "fv (Lam a t) = fv t - {atom a}"

lemma fv_eqvt:

  shows "(p \<bullet> fv t) = fv (p \<bullet> t)"

apply(lifting rfv_eqvt)

done

lemma alpha_gen_rsp_pre:

  assumes a5: "\<And>t s. R t s \<Longrightarrow> R (pi \<bullet> t) (pi \<bullet> s)"

  and     a1: "R s1 t1"

  and     a2: "R s2 t2"

  and     a3: "\<And>a b c d. R a b \<Longrightarrow> R c d \<Longrightarrow> R1 a c = R2 b d"

  and     a4: "\<And>x y. R x y \<Longrightarrow> fv1 x = fv2 y"

  shows   "(a, s1) \<approx>gen R1 fv1 pi (b, s2) = (a, t1) \<approx>gen R2 fv2 pi (b, t2)"

apply (simp add: alpha_gen.simps)

apply (simp only: a4[symmetric, OF a1] a4[symmetric, OF a2])

apply auto

apply (subst a3[symmetric])

apply (rule a5)

apply (rule a1)

apply (rule a2)

apply (assumption)

apply (subst a3)

apply (rule a5)

apply (rule a1)

apply (rule a2)

apply (assumption)

done

lemma [quot_respect]: "(prod_rel op = alpha ===>

           (alpha ===> alpha ===> op =) ===> (alpha ===> op =) ===> op = ===> prod_rel op = alpha ===> op =)

           alpha_gen alpha_gen"

apply simp

apply clarify

apply (rule alpha_gen_rsp_pre[of "alpha",OF alpha_eqvt])

apply auto

done

lemma pi_rep: "pi \<bullet> (rep_lam x) = rep_lam (pi \<bullet> x)"

apply (unfold rep_lam_def)

sorry

lemma [quot_preserve]: "(prod_fun id rep_lam --->

           (abs_lam ---> abs_lam ---> id) ---> (abs_lam ---> id) ---> id ---> (prod_fun id rep_lam) ---> id)

           alpha_gen = alpha_gen"

apply (simp add: expand_fun_eq)

apply (simp add: alpha_gen.simps)

apply (simp add: pi_rep)

apply (simp only: Quotient_abs_rep[OF Quotient_lam])

apply auto

done

lemma alpha_prs [quot_preserve]: "(rep_lam ---> rep_lam ---> id) alpha = (op =)"

apply (simp add: expand_fun_eq)

sorry

lemma a3:

  "\<exists>pi. ({atom a}, t) \<approx>gen (op =) fv pi ({atom b}, s) \<Longrightarrow> Lam a t = Lam b s"

  apply (lifting a3)

  done

lemma a3_inv:

  assumes "Lam a t = Lam b s"

  shows "\<exists>pi. (fv t - {atom a} = fv s - {atom b} \<and> (fv t - {atom a})\<sharp>* pi \<and> (pi \<bullet> t) = s)"

using assms

apply(lifting a3_inverse)

done

         \<exists>pi. fv t - {atom a} = fv s - {atom b} \<and> (fv t - {atom a}) \<sharp>* pi \<and> (pi \<bullet> t) = s\<rbrakk> 

   \<Longrightarrow> P\<rbrakk>

(* not sure whether needed *)

        \<lbrakk>\<exists>pi. fv t - {atom a} = fv s - {atom b} \<and>

         (fv t - {atom a}) \<sharp>* pi \<and> ((pi \<bullet> t) = s \<and> qxb (pi \<bullet> t) s)\<rbrakk> 

     \<Longrightarrow> qxb (Lam a t) (Lam b s)\<rbrakk>

(* should they lift automatically *)

apply(regularize)

prefer 2

apply(regularize)

prefer 2

lemma Lam_pseudo_inject:

  shows "(Lam a t = Lam b s) = 

      (\<exists>pi. (fv t - {atom a} = fv s - {atom b} \<and> (fv t - {atom a})\<sharp>* pi \<and> (pi \<bullet> t) = s))"

apply(rule iffI)

apply(rule a3_inv)

apply(assumption)

apply(rule a3)

apply(assumption)

done

apply (erule alpha.cases)

apply (simp_all only: rlam.distinct)