Require Export FcEtt.fset_facts.
Require Export FcEtt.ett_inf.
Require Export FcEtt.tactics.
(* This file contains:  - Syntactic stuff that should be defined by lngen (and that we should get LNgen to generate in the future).  - Induction principles for the relations.  - Other tactics that are specialized to the relations.  *)
Set Bullet Behavior "Strict Subproofs".
Set Implicit Arguments.
(* --------------------------------------------------------- *)
Ltac invert_syntactic_equality :=
repeat match goal with
| [ H : a_Var_f _  = a_Var_f _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_Abs _ _ = a_Abs _ _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_UAbs _ _ = a_UAbs _ _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_Pi _ _ _ = a_Pi _ _ _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_App _ _ _ = a_App _ _ _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_Fam _  = a_Fam _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_Const _  = a_Const _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_Conv _ _ = a_Conv _ _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_UCAbs _ = a_UCAbs _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_CAbs + _ = a_CAbs _ _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_CApp _ _  = a_CApp _ _ |- _ ] =>
inversion H; subst; clear H
| [ H : a_CPi _ _ = a_CPi _ _ |- _ ] =>
inversion H; subst; clear H
| [ H : Eq _ _ _ = Eq _ _ _ |- _ ] =>
inversion H; subst; clear H
end.
(* Invert an "interesting" assumption in the typing context *)
Ltac ann_invert_clear :=
match goal with
| H : AnnTyping _ a_Star _ |- _ => inversion H; subst; clear H
| H : AnnTyping _ (_ _) _ |- _ =>  inversion H; subst; clear H
| H : AnnPropWff _ _ |- _ => inversion H; subst; clear H
| H : AnnIso _ _ (_ _) _ _ |- _ => inversion H; subst; clear H
| H : AnnDefEq _ _ (_ _) _ _  |- _ => inversion H; subst; clear H
| H : AnnCtx ([(_,_)] ++ _) |- _ => inversion H; subst; clear H
| H : AnnCtx (_ :: _) |- _ => inversion H; subst; clear H
end.
(* ----------------------------- *)
(* By default, swaps apply to tm variables. *)
(* --------------------------------------------------- *)
(* --------------------------------------------------- *)
(* Induction schemes *)
Scheme typing_ind' := Induction for Typing Sort Prop
with wff_ind'   := Induction for PropWff Sort Prop
with iso_ind'   := Induction for Iso Sort Prop
with defeq_ind' := Induction for DefEq Sort Prop
with ctx_ind'   := Induction for Ctx Sort Prop.
Combined Scheme typing_wff_iso_defeq_mutual from typing_ind', wff_ind', iso_ind', defeq_ind', ctx_ind'.
Scheme ann_typing_ind' := Induction for AnnTyping Sort Prop
with ann_wff_ind'   := Induction for AnnPropWff Sort Prop
with ann_iso_ind'   := Induction for AnnIso Sort Prop
with ann_defeq_ind' := Induction for AnnDefEq Sort Prop
with ann_ctx_ind'   := Induction for AnnCtx Sort Prop.
Combined Scheme ann_typing_wff_iso_defeq_mutual
from ann_typing_ind', ann_wff_ind', ann_iso_ind',
ann_defeq_ind', ann_ctx_ind'.
Scheme CoercedValue_ind' := Induction for CoercedValue Sort Prop
with Value_ind' := Induction for Value Sort Prop.
Combined Scheme CoercedValue_Value_mutual from CoercedValue_ind', Value_ind'.
(* --------------------------------------------------- *)
(* Apply the mutual induction hypothesis and add a marker to the context indicating the current case (and also making the associated data constructor for that case available) as the name 'CON'. *)
Ltac ext_induction CON :=
apply typing_wff_iso_defeq_mutual;
[ pose CON :=  E_Star       |
pose CON :=  E_Var        |
pose CON :=  E_Pi         |
pose CON :=  E_Abs        |
pose CON :=  E_App        |
pose CON :=  E_IApp       |
pose CON :=  E_Conv       |
pose CON :=  E_CPi        |
pose CON :=  E_CAbs       |
pose CON :=  E_CApp       |
pose CON :=  E_Const      |
pose CON :=  E_Fam        |
pose CON :=  E_Wff        |
pose CON :=  E_PropCong   |
pose CON :=  E_IsoConv    |
pose CON :=  E_CPiFst     |
pose CON :=  E_Assn       |
pose CON :=  E_Refl       |
pose CON :=  E_Sym        |
pose CON :=  E_Trans      |
pose CON :=  E_Beta       |
pose CON :=  E_PiCong     |
pose CON :=  E_AbsCong    |
pose CON :=  E_AppCong    |
pose CON :=  E_IAppCong   |
pose CON :=  E_PiFst      |
pose CON :=  E_PiSnd      |
pose CON :=  E_CPiCong    |
pose CON :=  E_CAbsCong   |
pose CON :=  E_CAppCong   |
pose CON :=  E_CPiSnd     |
pose CON :=  E_Cast       |
pose CON :=  E_EqConv     |
pose CON :=  E_IsoSnd     |
pose CON :=  E_EtaRel     |
pose CON :=  E_EtaIrrel   |
pose CON :=  E_EtaC       |
(*      pose CON :=  E_LeftRel    | pose CON :=  E_LeftIrrel  | pose CON :=  E_Right      | pose CON :=  E_CLeft      | *)
pose CON :=  E_Empty      |
pose CON :=  E_ConsTm     |
pose CON :=  E_ConsCo     ].
Ltac ann_induction CON :=
apply ann_typing_wff_iso_defeq_mutual;
[ pose CON :=  An_Star       |
pose CON :=  An_Var        |
pose CON :=  An_Pi         |
pose CON :=  An_Abs        |
pose CON :=  An_App        |
pose CON :=  An_Conv       |
pose CON :=  An_CPi        |
pose CON :=  An_CAbs       |
pose CON :=  An_CApp       |
pose CON :=  An_Const      |
pose CON :=  An_Fam        |
pose CON :=  An_Wff        |
pose CON :=  An_PropCong   |
pose CON :=  An_CPiFst     |
pose CON :=  An_IsoSym     |
pose CON :=  An_IsoConv    |
pose CON :=  An_Assn       |
pose CON :=  An_Refl       |
pose CON :=  An_EraseEq      |
pose CON :=  An_Sym        |
pose CON :=  An_Trans      |
pose CON :=  An_Beta       |
pose CON :=  An_PiCong     |
pose CON :=  An_AbsCong    |
pose CON :=  An_AppCong    |
pose CON :=  An_PiFst      |
pose CON :=  An_PiSnd      |
pose CON :=  An_CPiCong    |
pose CON :=  An_CAbsCong   |
pose CON :=  An_CAppCong   |
pose CON :=  An_CPiSnd     |
pose CON :=  An_Cast       |
pose CON :=  An_IsoSnd     |
pose CON :=  An_Eta        |
pose CON :=  An_EtaC       |
(*      pose CON :=  An_Left       | pose CON :=  An_Right      | pose CON :=  An_CLeft      | *)
pose CON :=  An_Empty      |
pose CON :=  An_ConsTm     |
pose CON :=  An_ConsCo     ].
Ltac ensure_case C :=
match goal with [ CON := C : ?A |- _ ] => idtac end.
(* --------------------------------------------------- *)
(* Tactic support for freshness *)
(*  What does "fresh" mean for variables? *)
Ltac gather_atoms ::=
let A := gather_atoms_with (fun x : vars => x) in
let B := gather_atoms_with (fun x : var => {{ x }}) in
let C1 := gather_atoms_with (fun x : context => dom x) in
let D1 := gather_atoms_with (fun x => fv_tm_tm_tm x) in
let D2 := gather_atoms_with (fun x => fv_tm_tm_co x) in
let D3 := gather_atoms_with (fun x => fv_tm_tm_constraint x) in
let D4 := gather_atoms_with (fun x => fv_tm_tm_sort x) in
let D5 := gather_atoms_with (fun x => fv_tm_tm_brs x) in
let D6 := gather_atoms_with (fun x => fv_co_co_tm x) in
let D7 := gather_atoms_with (fun x => fv_co_co_co x) in
let D8 := gather_atoms_with (fun x => fv_co_co_constraint x) in
let D9 := gather_atoms_with (fun x => fv_co_co_sort x) in
let D10 := gather_atoms_with (fun x => fv_co_co_brs x) in
constr:(A \u B \u C1 \u D1 \u D2 \u D3 \u D4 \u D5 \u D6 \u D7 \u D8 \u D9 \u D10).
(* ----------------------------------------------------- *)
(* Rewrite the goal based on a equation in the context (i.e. using an equation from an eta-equivalence rule or from one of the Cong rules) *)
Ltac rewrite_body :=
match goal with
| [ e : ∀ x : atom, (x `in` ?L → False)
→ open_tm_wrt_tm _ (a_Var_f x) = open_tm_wrt_tm _ (_ (a_Var_f x) _) |- _ ] =>
rewrite e; auto
| [ e : ∀ x : atom, (x `notin` ?L)
→ open_tm_wrt_tm _ (a_Var_f x) = open_tm_wrt_tm _ (_ (a_Var_f x) _) |- _ ] =>
rewrite e; auto
| [ e : ∀ c : atom, (c `notin` ?L)
→ open_tm_wrt_co _ (g_Var_f c) =
open_tm_wrt_co _ (g_Cast (g_Var_f c) (g_Sym _)) |- _ ] =>
rewrite e; auto
| [ e : ∀ x : atom, (x `in` ?L → False) →  _ _ (a_Var_f x) = _ _ _ (a_Var_f x) |- _ ] =>
rewrite e; auto
| [ e : ∀ x : atom, (x `in` ?L → False) →  _ _ (a_Var_f x) = _ _ _ (a_Bullet) |- _ ] =>
rewrite e; auto
| [ e : ∀ x : atom, (x `notin` ?L) →  _ _ (a_Var_f x) = _ _ _ (a_Var_f x) |- _ ] =>
rewrite e; auto
| [ e : ∀ x : atom, (x `notin` ?L) →  _ _ (a_Var_f x) = _ _ _ (a_Bullet) |- _ ] =>
rewrite e; auto
| [ e: ∀ c : atom,
(c `in` ?L → False) → _ _ (g_Var_f c) = a_CApp _ _ |- _ ] =>
rewrite e; auto
| [ e: ∀ c : atom,
(c `notin` ?L) → _ _ (g_Var_f c) = a_CApp _ _ |- _ ] =>
rewrite e; auto
end.
(* Solver for the two lc_mutual proofs. *)
Ltac lc_solve :=
let c := fresh in
try lc_solve_binds;
try apply_lc_exists c;
lc_inversion c; auto;
try rewrite_body;
try apply_lc_body;
eauto with lc.
(* without these two lines, ext_consist.v fails. *)
Hint Resolve lc_a_Pi_exists
lc_a_CPi_exists lc_a_Abs_exists lc_a_CAbs_exists lc_a_UAbs_exists.
(* This hint is restricted to lngen in ett_inf. *)
Hint Resolve lc_body_tm_wrt_tm lc_body_tm_wrt_co. (* binds_cons_1 *)
(* ---------------------------------------- *)
(*  Lemma fv_tm_tm_tm_open_wrt_tm_mutual: (forall a1 a2 x n, x `in` fv_tm_tm_tm a1 -> x `in` fv_tm_tm_tm (open_tm_wrt_tm_rec n a2 a1)) /\ (forall brs a2 x n, x `in` fv_tm_tm_brs brs -> x `in` fv_tm_tm_brs (open_brs_wrt_tm_rec n a2 brs)) /\ (forall g a2 x n, x `in` fv_tm_tm_co g -> x `in` fv_tm_tm_co (open_co_wrt_tm_rec n a2 g)) /\ (forall phi1 a2 x n, x `in` fv_tm_tm_constraint phi1 -> x `in` fv_tm_tm_constraint (open_constraint_wrt_tm_rec n a2 phi1)).  Lemma fv_tm_tm_tm_open_wrt_co_mutual: (forall a1 a2 x n, x `in` fv_tm_tm_tm a1 -> x `in` fv_tm_tm_tm (open_tm_wrt_co_rec n a2 a1)) /\ (forall brs a2 x n, x `in` fv_tm_tm_brs brs -> x `in` fv_tm_tm_brs (open_brs_wrt_co_rec n a2 brs)) /\ (forall g a2 x n, x `in` fv_tm_tm_co g -> x `in` fv_tm_tm_co (open_co_wrt_co_rec n a2 g)) /\ (forall phi1 a2 x n, x `in` fv_tm_tm_constraint phi1 -> x `in` fv_tm_tm_constraint (open_constraint_wrt_co_rec n a2 phi1)).  Lemma fv_tm_tm_tm_open_tm_wrt_tm: forall a1 a2 x, x `in` fv_tm_tm_tm a1 -> x `in` fv_tm_tm_tm (open_tm_wrt_tm a1 a2).  Lemma fv_tm_tm_tm_open_tm_wrt_co: forall a1 a2 x, x `in` fv_tm_tm_tm a1 -> x `in` fv_tm_tm_tm (open_tm_wrt_co a1 a2).  *)
(* ----------------------------------------------------------------------- *)
(* TODO: These tactics may be a little loose when filtering the cases (to determine whether or not they should kick in). If the automation is too slow, this is something to keep an eye on *)
(* TODO: it may be possible to improve these tactics by matching on the production (return type) of the hyp in the context *)
(* Ltac oh_c'mon := let x := fresh in pick fresh x; multimatch goal with | [ H : forall _ : atom, _ |- _ ] => solve [destruct (H x); basic_solve] end.  Ltac invert_open_wrt := subst; multimatch goal with | [ H : context [?A] |- _ ?A      ] => solve [inversion H; clear H; subst; basic_solve] | [ H : context [?A] |- lc_tm (_ ?A _)] => solve [inversion H; clear H; try solve_by_inv_hyp_about A; basic_solve] end. *)
(* Ltac des_bind_cons := multimatch goal with (* So far, this hole ---↓ was only filled with lc_sort. *)
| [ H : binds _ ?s _ |- _ ?s] => solve [destruct (binds_cons_1 _ _ _ _ _ _ H); basic_solve]
end.
*)
(* ----------------------------- *)

Lemma eta_swap_c: forall x y a' b,
x `notin` fv_co_co_tm a' \u fv_co_co_tm b ->
open_tm_wrt_co a' (g_Var_f x) = a_CApp b g_Triv ->
open_tm_wrt_co a' (g_Var_f y) = a_CApp b g_Triv.