(*
    Record function: Type := mkfun {
      body:> relation2 X Y -> relation2 X Y;
      Hmon: forall R S, incl R S -> incl (body R) (body S)
    }.
*)

    Definition function2 := relation2 X Y -> relation2 X' Y'.Definition function  := relation2 X Y -> relation2 X Y.Definition increasing (F: function) := 
      forall R S, incl R S -> incl (F R) (F S).Definition contains (F G: function2) := forall R, incl (F R) (G R).(** Constant and identity functions *)
    Definition constant S: function2 := fun _ => S.Definition identity: function := fun R => R.(** Binary and general union functions *)
    Definition Union2 F G: function2 := fun R => union2 (F R) (G R).Definition Union I H: function2 := fun R => union (fun i: I => H i R).Definition transparent (B: relation X) (F: function2 X Y X Y') := 
      forall R, incl (F (comp (star B) R)) (comp (star B) (F R)).(** Chaining functions *)
    Definition chaining_l (S: relation2 X Y): function2 Y Z X Z := comp S.Definition chaining_r (S: relation2 Y Z): function2 X Y X Z := fun R => comp R S.Definition Chain (F: function2 X Y X' Y') (G: function2 X Y Y' Z') := fun R => comp (F R) (G R).(** Composition *)
    Definition Comp (G: function2 X' Y' X'' Y'') (F: function2 X Y X' Y') := fun R => G (F R).(** Simple iteration function *)
    Fixpoint Exp(n: nat): relation2 X Y :=
      match n with
	| O => R
	| S n => F (Exp n)
      end.Definition Iter := union Exp.(** Increasing iteration function *)
    (* inverser n et R ? *)
    Fixpoint UExp(n: nat): relation2 X Y := 
      match n with
	| O => R
	| S n => union2 (UExp n) (F (UExp n))
      end.Definition UIter := union UExp.

Lemma UExp_UExp: forall R m n, UExp F (UExp F R n) m = UExp F R (m+n).