(*========================================================== ============================================================  TOPOLOGICAL FMAPS, QHMAPS, HMAPS -  PROOFS OF THE GENUS THEOREM AND THE EULER RELATION  PART 1: BASES, FMAPS, QHMAPS, HMAPS, CLOSURES OF A, A_1  (J.-F. Dufourd, June 2006 - FOR PUBLICATION completed in October 2007)  ============================================================ ==========================================================*)
(* coqtop -opt *)
Global Set Asymmetric Patterns.
(*======================================================== DIMENSIONS ========================================================*)
(* Dimensions: *)
Inductive dim:Set := di0 : dim | di1 : dim.
(* Action of B_1 on exd: *)
induction m.
simpl in |- *.
tauto.
simpl in |- *.
intros.
generalize (IHm k x y).
tauto.
simpl in |- *.
intros k x y.
elim (eq_dim_dec k d).
elim (eq_dart_dec x d1).
generalize (IHm k x y).
tauto.
simpl in |- *.
generalize (IHm k x y).
tauto.
simpl in |- *.
intro.
apply IHm.
Qed.
(*========================================================== I- AND L-PRECONDITIONS, QUASI-HMAPS ==========================================================*)
(* For a unique insertion of a non nil dart in a (future) qhmap: *)
Definition prec_I (m:fmap)(x:dart):=
x <> nil /\ ~ exd m x .
(* For correctness of functional link insertion, maybe incomplete, in a (future) qhmap: *)
Definition prec_Lq (m:fmap)(k:dim)(x y:dart) :=
exd m x /\ exd m y /\ ~ succ m k x /\ ~ pred m k y.
(* Quasi-map's topological invariant: in 2 parts *)
Fixpoint inv_qhmap(m:fmap){struct m}:Prop:=
match m with
V => True
| I m0 x0 => inv_qhmap m0
/\ prec_I m0 x0
| L m0 k0 x0 y0 => inv_qhmap m0
/\ prec_Lq m0 k0 x0 y0
end.
(* Definition of the qhmap type: (not used) *)
Definition qhmap:Set := {m:fmap | inv_qhmap m}.
(* Projection of a qhmap to its fmap support: *)
Definition qhmap_to_fmap(q:qhmap):fmap:=
match q with exist m _=> m end.
(* The projection is declared as a coercion: *)
Coercion qhmap_to_fmap: qhmap >-> fmap.
(*========================================================= A LOT OF PROPERTIES NEEDING inv_qhmap ONLY ==========================================================*)
(* nil isn't in a qhmap: *)
(* and the inverse: *)
(* Relationship between succ and exd: *)
(* Idem with pred and exd: *)
(* A non existing dart has no successor: *)
(* Idem: *)
(* Note that, in a qmap m, it is not True that: exd m x -> A m k x <> nil, exd m x -> A_1 m k x <> nil *)
(* Note also: *)
(* A true successor always exists: *)
(* Idem with: *)
(* Inverses: *)
(* Idem: *)
(*========================================================= A AND A_1 ARE INVERSE INJECTIONS IN A qhmap: ==========================================================*)
(* In a qmap, A et A_1 are inverses of each other: *)
(* Idem with A_1: *)
(* Partial injection on dart, Df giving the domain of f: *)
Definition inj_dart(Df:dart->Prop)(f:dart->dart):Prop:=
forall x x':dart,
(Df x)->(Df x')->(f x)=(f x')->x=x'.
(* (A m k) is an injection on (succ m k): *)
(* Idem, for pred and A_1*)
(* Idem: (A_1 m k) is an injection on (pred m k): *)
(*========================================================== CLOSURES of A AND A_1 IN qhmap ==========================================================*)
(* Closures of A and A_1, together designed for qhmaps, mutually recursive: *)
Fixpoint cA
(m:fmap)(k:dim)(x:dart){struct m}:dart:=
match m with
V => nil
|  I m0 x0 =>
if eq_dart_dec x x0 then x
else cA m0 k x
|  L m0 k0 x0 y0 =>
if (eq_dim_dec k k0)
then
if (eq_dart_dec x x0) then y0
else
if (eq_dart_dec x (cA_1 m0 k y0))
then cA m0 k x0
else cA m0 k x
else cA m0 k x
end
with cA_1
(m:fmap)(k:dim)(x:dart){struct m}:dart:=
match m with
V => nil
|  I m0 x0 =>
if eq_dart_dec x x0 then x
else cA_1 m0 k x
|  L m0 k0 x0 y0 =>
if (eq_dim_dec k k0)
then
if (eq_dart_dec x y0) then x0
else
if (eq_dart_dec x (cA m0 k x0))
then cA_1 m0 k y0
else cA_1 m0 k x
else cA_1 m0 k x
end.
(* Notations ? Notation "A~" := cA.  Notation "A_1~" := cA_1.  Notation "A~" := cA.  Notation "A_1~" := cA_1. *)
(* In fact, a qhmap m equipped with (cA m di0) and (cA m di1) is a hmap: cf. below. *)
(* Each dart of an fmap has a succ and a pred in the closure: *)
(* Each dart of a qhmap has a succ and a pred for the closure: *)
(* If the succ for cA is in the qhmap, the initial dart also: *)
(* Idem for cA_1: *)
(* Inverse for exd: *)
(* Idem: *)
(* cA and cA_1 are inverses of each other: *)
(* IDEM: the inverse: *)
(* (cA m k) in an injection on (exd m): *)
(* Idem: cA_1 is an injection on exd: *)

Lemma inj_cA_1:
forall (m:fmap)(k:dim), inv_qhmap m ->
inj_dart (exd m) (cA_1 m k).