Merge pull request #152 from arnoudvanderleer/rename-category-packages

Update references to category packages
UniMath · Feb 7, 2024 · f7b0b31 · f7b0b31
2 parents 70ab337 + 1c51541
commit f7b0b31
Show file tree

Hide file tree

Showing 53 changed files with 721 additions and 721 deletions.
diff --git a/Modules/NonRawSignatures/FullArToRaw.v b/Modules/NonRawSignatures/FullArToRaw.v
@@ -35,13 +35,13 @@ Require Import Modules.Signatures.HArityDerivation.
 (* Require Import Modules.Signatures.CheckCorrespondanceAdjonction. *)
 Require Import UniMath.SubstitutionSystems.BindingSigToMonad.
 
-Require Import UniMath.CategoryTheory.categories.category_hset.
+Require Import UniMath.CategoryTheory.Categories.category_hset.
 
-Require Import UniMath.CategoryTheory.categories.category_hset_structures.
-Require Import UniMath.CategoryTheory.limits.coproducts.
-Require Import UniMath.CategoryTheory.limits.binproducts.
-Require Import UniMath.CategoryTheory.limits.bincoproducts.
-Require Import UniMath.CategoryTheory.limits.terminal.
+Require Import UniMath.CategoryTheory.Categories.category_hset_structures.
+Require Import UniMath.CategoryTheory.Limits.Coproducts.
+Require Import UniMath.CategoryTheory.Limits.BinProducts.
+Require Import UniMath.CategoryTheory.Limits.BinCoproducts.
+Require Import UniMath.CategoryTheory.Limits.Terminal.
 
 Require Import Modules.Prelims.deriveadj.
 
@@ -71,7 +71,7 @@ Section CoBindingArity.
 (** Content of this section:
     - translate a natural number into a half-arity
 *)
-  
+
 Fixpoint nat_deriv_HAr {C : category} bcp T (n :nat) : arity C :=
   match n with
     0 => tautological_harity
@@ -88,15 +88,15 @@ Definition nat_prod_HAr {C : category} (bp : BinProducts C) (n : nat) : arity C
   iter_functor (prodHAr bp) n tautological_harity.
 
 Definition CoBinding_to_FullArity {C : category} bcp T ( a : HAr.arity C)
-           (n : nat) 
+           (n : nat)
   : FullArity C
   :=  a ,, nat_deriv_HAr bcp T n.
 
 Context {C : category} .
 Hypothesis ( bp : BinProducts C).
 Let bpHAr := harity_BinProducts (C := C) bp.
 Local Notation BPO := (BinProductObject _).
-  
+
   (* Let prodHAr  := *)
   (*   (functor_fix_snd_arg _ _ _  (binproduct_functor  (harity_BinProducts bp )) *)
   (*                        (tautological_harity)). *)
@@ -105,7 +105,7 @@ Local Notation BPO := (BinProductObject _).
 (*   iter_functor prodHAr n a. *)
 
 (** Input: an arity [a] and a natural number
-    Output: [a × θ × θ × ... × θ] 
+    Output: [a × θ × θ × ... × θ]
 *)
 Fixpoint DeBind_HArity  (a : HAr.arity C) (n : nat) : HAr.arity C :=
   match n with
@@ -155,13 +155,13 @@ Section NoSetGenNat.
   (* Local Notation "×ℜ" :=  (bpM. *)
   Local Notation Θ :=  (tautological_LModule).
 
-  Let deriv_pb_iso {R S : Monad C} (f : Monad_Mor R S) 
+  Let deriv_pb_iso {R S : Monad C} (f : Monad_Mor R S)
       : ∏ M, iso (C := MOD R) (pb_LModule f (M ')) ((pb_LModule f M) ')
     :=
     pb_deriv_to_deriv_pb_iso Tset bcp (D := C) f.
 
-  Let bp_pb_iso {R S : Monad C} (f : Monad_Mor R S) 
-    : ∏ M N, iso (C := MOD R) 
+  Let bp_pb_iso {R S : Monad C} (f : Monad_Mor R S)
+    : ∏ M N, iso (C := MOD R)
                  (bpM _ (pb_LModule f M)(pb_LModule f N) )
                  (pb_LModule f (bpM _ M N))
     :=
@@ -240,15 +240,15 @@ M×R ---------> f* A x f* S ------> f*(A x S) -------> f* B
   Let c_n n : HalfArity := DeBind_HArity bp   a n.
   Let d_n n : FullArity C := c_n n ,, tautological_harity.
 
-  Definition equiv_is_rep_ar_one_to_raw (a' : HalfArity) n R : 
+  Definition equiv_is_rep_ar_one_to_raw (a' : HalfArity) n R :
                  LModule_Mor R (a' R)(nat_d_HAr (S n) R) ≃
                              LModule_Mor R (BPO (LMOD_bp R (a' R) (tautological_LModule R)))
                              (nat_d_HAr n R).
   Proof.
     apply adj1.
   Defined.
 
-  Definition equiv_is_rep_ar_to_raw (a' : HalfArity) n R : 
+  Definition equiv_is_rep_ar_to_raw (a' : HalfArity) n R :
                  LModule_Mor R (a' R)( nat_d_HAr n R) ≃
                              LModule_Mor R ((DeBind_HArity bp a' n : HAr.arity _) R)
                              (tautological_LModule R).
@@ -357,7 +357,7 @@ M×R ---------> f* A x f* S ------> f*(A x S) -------> f* B
       apply (transport_arity_mor _ _ _ _ _ e xx yy ff).
   Defined.
 
-  
+
   Definition FAr_to_HAr_one_functor n : (rep_disp C)[{a_n (S n)}] ⟶ (rep_disp C)[{b_n n}] :=
     _ ,, FAr_to_HAr_one_is_functor n.
 
@@ -371,7 +371,7 @@ M×R ---------> f* A x f* S ------> f*(A x S) -------> f* B
 End NoSetGenNat.
 
 Section FAR_ToHAR_Rep.
-  
+
   Context {C : category}.
   Hypothesis ( bp : BinProducts C).
   Hypothesis ( bcp : BinCoproducts C).
@@ -401,13 +401,13 @@ Section FAR_ToHAR_Rep.
   (* Local Notation "×ℜ" :=  (bpM. *)
   Local Notation Θ :=  (tautological_LModule).
 
-  Let deriv_pb_iso {R S : Monad C} (f : Monad_Mor R S) 
+  Let deriv_pb_iso {R S : Monad C} (f : Monad_Mor R S)
       : ∏ M, iso (C := MOD R) (pb_LModule f (M ')) ((pb_LModule f M) ')
     :=
     pb_deriv_to_deriv_pb_iso Tset bcp (D := C) f.
 
-  Let bp_pb_iso {R S : Monad C} (f : Monad_Mor R S) 
-    : ∏ M N, iso (C := MOD R) 
+  Let bp_pb_iso {R S : Monad C} (f : Monad_Mor R S)
+    : ∏ M N, iso (C := MOD R)
                  (bpM _ (pb_LModule f M)(pb_LModule f N) )
                  (pb_LModule f (bpM _ M N))
     :=
@@ -438,7 +438,7 @@ Par l'adjonction ça doit devenir
 M x R ----> N --------> f*A
 
 *)
-  
+
   Hypothesis adj_law1 :
                 ∏ R S (f : Monad_Mor (C := C) R S)
                   (M N : LModule R _) (A : LModule S _)
@@ -520,7 +520,7 @@ Section NoSet.
   Lemma HAr_rep_ar_mor_law_nt {a b : HAr.arity _} (M : HAr.rep_ar _ a)
              (N : HAr.rep_ar _ b)
            (f : arity_Mor a b) (g : Monad_Mor M N) :
-  HAr.rep_ar_mor_law _ M N f g ≃ 
+  HAr.rep_ar_mor_law _ M N f g ≃
                      ((HAr.rep_τ _ M : (MOD _ ⟦_,_⟧))  · (monad_mor_to_lmodule g)  =
                       ((#a g)%ar : MOD _ ⟦_,_⟧)  ·
                                                  pb_LModule_Mor g
@@ -546,12 +546,12 @@ Section NoSet.
 
   (*inutile TODO suppriemr *)
 Definition FAr_rep_ar_mor_law_nt {a b : FullArity C} (M : rep_ar _ a) (N : rep_ar _ b)
-           (f : FullArity C ⟦ a,  b⟧) (g : Monad_Mor M N) : 
+           (f : FullArity C ⟦ a,  b⟧) (g : Monad_Mor M N) :
   rep_ar_mor_law C M N f g ≃ (
    (rep_τ _ M : MOD _ ⟦_ , _⟧)  · ((#(codom a) g)%ar)  =
             ((#(dom a) g)%ar : MOD _ ⟦_ , _⟧)  · pb_LModule_Mor g (dom_mor f N)  ·
                                                pb_LModule_Mor g (rep_τ _ N)  ·
-                                               pb_LModule_Mor g (codom_mor f N) 
+                                               pb_LModule_Mor g (codom_mor f N)
                    ).
 Proof.
     apply weqinvweq.
@@ -630,7 +630,7 @@ Defined.
   Local Notation BPO := (BinProductObject _).
   Let b n : HalfArity := BPO (bpHAr a (nat_p_HAr n)).
 
-  Definition equiv_is_rep_ar_to_raw R : 
+  Definition equiv_is_rep_ar_to_raw R :
                  LModule_Mor R (a R)(nat_d_HAr 1 R) ≃
                              LModule_Mor R (b 1 R)(tautological_LModule R).
   Proof.
@@ -664,13 +664,13 @@ Defined.
 (*   rep_ar_mor_law  M N f g ≃  (rep_τ M : nat_trans _ _) · ((#(codom a) g)%ar:nat_trans _ _)  = *)
 (*             ((#(dom a) g)%ar:nat_trans _ _)  · dom_mor f N  · *)
 (*                                             rep_τ N c · codom_mor f N c. *)
-  Let deriv_pb_iso {R S : Monad C} (f : Monad_Mor R S) 
+  Let deriv_pb_iso {R S : Monad C} (f : Monad_Mor R S)
       : ∏ M, iso (C := MOD R) (pb_LModule f (M ')) ((pb_LModule f M) ')
     :=
     pb_deriv_to_deriv_pb_iso Tset bcp (D := C) f.
 
-  Let bp_pb_iso {R S : Monad C} (f : Monad_Mor R S) 
-    : ∏ M N, iso (C := MOD R) 
+  Let bp_pb_iso {R S : Monad C} (f : Monad_Mor R S)
+    : ∏ M N, iso (C := MOD R)
                  (bpM _ (pb_LModule f M)(pb_LModule f N) )
                  (pb_LModule f (bpM _ M N))
     :=
@@ -720,7 +720,7 @@ M×R ---------> f* A x f* S ------> f*(A x S) -------> f* B
                                                       · pb_LModule_Mor f (adj1 _ _ _ v)
 
                 (* (# ×ℜ (dirprodpair (u : MOD R ⟦_,_⟧) (monad_mor_to_lmodule f : MOD R ⟦_,_⟧))) *)
-                
+
 
                 (* adj1 R  _ _  ((u : MOD R ⟦_,_⟧) · (pb_LModule_Mor f v) · deriv_pb_iso f _) *)
              ).
@@ -750,7 +750,7 @@ M×R ---------> f* A x f* S ------> f*(A x S) -------> f* B
     apply idweq.
   Qed.
 
-  Definition equiv_raw_ar_mor_law 
+  Definition equiv_raw_ar_mor_law
      {R S : rep_ar _ (a_n 1)} (f : Monad_Mor R S) :
                       rep_ar_mor_law _ R S (identity _) f ≃
                                      HAr.rep_ar_mor_law _ (Fob R) (Fob S)
@@ -811,6 +811,6 @@ M×R ---------> f* A x f* S ------> f*(A x S) -------> f* B
   Definition iso_FAr_HAr_rep : catiso _ _ :=
      FS,, (λ x y  , weqproperty (Fmor x y)),, weqproperty Fob.
 End NoSet.
-  
+
 
 *)
diff --git a/Modules/NonRawSignatures/HArityCoproductFromColims.v b/Modules/NonRawSignatures/HArityCoproductFromColims.v
@@ -17,8 +17,8 @@ Require Import UniMath.CategoryTheory.DisplayedCats.Auxiliary.
 Require Import UniMath.CategoryTheory.DisplayedCats.Core.
 Require Import UniMath.CategoryTheory.DisplayedCats.Constructions.
 
-Require Import UniMath.CategoryTheory.limits.coproducts.
-Require Import UniMath.CategoryTheory.limits.graphs.colimits.
+Require Import UniMath.CategoryTheory.Limits.Coproducts.
+Require Import UniMath.CategoryTheory.Limits.Graphs.Colimits.
 
 Require Import Modules.Prelims.lib.
 Require Import Modules.Prelims.modules.
@@ -110,7 +110,7 @@ Section pullback_coprod.
     etrans;[apply assoc|].
 
     etrans;[apply id_left|apply id_right].
-  
+
   Definition coprod_pbm_to_pbm_coprod : LModule_Mor  _ coprod_pbm pbm_coprod.
     use tpair.
     - use tpair
@@ -150,4 +150,4 @@ Section Coprod.
     : arity_on_morphisms  (R : Monad C) : LModule R C :=
     CoproductObject _ _ (LModule_coproducts_from_Colims R (fun o => α o R)).
 
-  Definition harity_coprod : HalfSignature.
+  Definition harity_coprod : HalfSignature.
diff --git a/Modules/NonRawSignatures/PresentableRawSig.v b/Modules/NonRawSignatures/PresentableRawSig.v
@@ -14,8 +14,8 @@ Require Import UniMath.CategoryTheory.DisplayedCats.Auxiliary.
 Require Import UniMath.CategoryTheory.DisplayedCats.Core.
 Require Import UniMath.CategoryTheory.DisplayedCats.Constructions.
 
-Require Import UniMath.CategoryTheory.limits.coproducts.
-Require Import UniMath.CategoryTheory.limits.initial.
+Require Import UniMath.CategoryTheory.Limits.Coproducts.
+Require Import UniMath.CategoryTheory.Limits.Initial.
 
 Require Import Modules.Prelims.lib.
 Require Import Modules.Prelims.modules.
@@ -29,9 +29,9 @@ Require Import Modules.Signatures.RawSigToHAr.
 Require Import Modules.Signatures.PresentableHArityCoproducts.
 Require Import Modules.Signatures.PresentableArity.
 Require  Modules.Signatures.FullSignatures.
-Require Import UniMath.CategoryTheory.categories.category_hset.
+Require Import UniMath.CategoryTheory.Categories.category_hset.
 
-Require Import UniMath.CategoryTheory.categories.category_hset_structures.
+Require Import UniMath.CategoryTheory.Categories.category_hset_structures.
 Module FAr := FullSignatures.
 
 Section RawSigRep.
@@ -54,14 +54,14 @@ Local Notation EndSet := [hset_category, hset_category].
 
     (** This uses univalence to transform an isomorphism of category into an equality
        Another proof could be used without univalence though
-       
+
      *)
   Lemma initial_presentable_raw_sig (ax:  AxiomOfChoice.AxiomOfChoice_surj): Initial (precategory_rep_sig (rawSigToSig rawsig)).
   Proof.
     eapply (transportb (fun X => Initial X)).
     apply catiso_to_precategory_path.
     - intros ? ? .
-      apply isaset_rep_a_sig_mor. 
+      apply isaset_rep_a_sig_mor.
     - unshelve apply iso_a_sig_har_rep.
       apply cp.
       apply setproperty.

diff --git a/Modules/NonRawSignatures/PresentableSig.v b/Modules/NonRawSignatures/PresentableSig.v
@@ -14,8 +14,8 @@ Require Import UniMath.CategoryTheory.DisplayedCats.Auxiliary.
 Require Import UniMath.CategoryTheory.DisplayedCats.Core.
 Require Import UniMath.CategoryTheory.DisplayedCats.Constructions.
 
-Require Import UniMath.CategoryTheory.limits.coproducts.
-Require Import UniMath.CategoryTheory.limits.initial.
+Require Import UniMath.CategoryTheory.Limits.Coproducts.
+Require Import UniMath.CategoryTheory.Limits.Initial.
 Require Import UniMath.CategoryTheory.EpiFacts.
 Require Import UniMath.CategoryTheory.Epis.
 
@@ -38,9 +38,9 @@ Require  Modules.Signatures.FullSignatures.
 Require Import Modules.Signatures.FullArToRaw.
 Require Import Modules.Signatures.SigEquivRep.
 Require Import Modules.Prelims.SetCatComplements.
-Require Import UniMath.CategoryTheory.categories.category_hset.
+Require Import UniMath.CategoryTheory.Categories.category_hset.
 
-Require Import UniMath.CategoryTheory.categories.category_hset_structures.
+Require Import UniMath.CategoryTheory.Categories.category_hset_structures.
 Module FAr := FullSignatures.
 
 Section RawSigRep.
@@ -63,17 +63,17 @@ Local Notation bpSET := BinProductsHSET.
     : hSet := pr1 S.
 Local Notation O := base_of_pres_sig.
 
-Definition ar_of_pres_sig 
+Definition ar_of_pres_sig
              {C} {bpC} {bcpC} {Tc} {cpC}
              (S : PresentableSignature (C:=C)bpC bcpC Tc cpC)
   : O S -> arity C := fun o => (pr1 (pr1 (pr2 S o))).
-Definition ar_of_pres_sig_isPresentable 
+Definition ar_of_pres_sig_isPresentable
              {C} {bpC} {bcpC} {Tc} {cpC}
              (S : PresentableSignature (C:=C)bpC bcpC Tc cpC)
   : ∏ o,   isPresentable bpC bcpC Tc cpC (ar_of_pres_sig S o):= fun o => (pr2 (pr1 (pr2 S o))).
 
 Local Notation α := ar_of_pres_sig.
-Definition nat_of_pres_sig 
+Definition nat_of_pres_sig
              {C} {bpC} {bcpC} {Tc} {cpC}
              (S : PresentableSignature (C:=C)bpC bcpC Tc cpC)
   : O S -> nat := fun o => ( (pr2 (pr2 S o))).
@@ -104,7 +104,7 @@ Import FullSignatures.
 
     (** This uses univalence to transform an isomorphism of category into an equality
        Another proof could be used without univalence though
- (@DeBind_HArity SET bpSET a n',, @tautological_harity SET)      
+ (@DeBind_HArity SET bpSET a n',, @tautological_harity SET)
 (@DeBind_HArity SET bpSET a n',, @tautological_harity SET)
      *)
 
@@ -160,14 +160,14 @@ Lemma initial_presentable_raw_sig sig (ax:  AxiomOfChoice.AxiomOfChoice_surj) :
              (PresentableSignature_to_signature (C:=SET) bp bcp T
                                                 (fun I => cp _ (setproperty I))  sig)).
 Proof.
-  set (sig' := PresentableSignature_to_signature _ _  _ _ sig). 
+  set (sig' := PresentableSignature_to_signature _ _  _ _ sig).
   eapply (transportb (fun X => Initial X)).
   apply catiso_to_precategory_path.
   - intros ? ? .
-    apply isaset_rep_a_sig_mor. 
+    apply isaset_rep_a_sig_mor.
   - exact (catiso_Presentable_Raw sig).
   - (* This is a presentable raw signature, so it is representable *)
-    set (rawS := 
+    set (rawS :=
            tpair (T := hSet) (fun z => z -> arity _)
                  (O sig)
                  (λ o : O sig, DeBind_HArity (C := SET) bpSET (α _ o) (nat_of_pres_sig _ o)) : rawSig).

diff --git a/Modules/NonRawSignatures/RawSigToHAr.v b/Modules/NonRawSignatures/RawSigToHAr.v
@@ -31,7 +31,7 @@ Require Import UniMath.CategoryTheory.DisplayedCats.Auxiliary.
 Require Import UniMath.CategoryTheory.DisplayedCats.Core.
 Require Import UniMath.CategoryTheory.DisplayedCats.Constructions.
 
-Require Import UniMath.CategoryTheory.limits.coproducts.
+Require Import UniMath.CategoryTheory.Limits.Coproducts.
 
 Require Import Modules.Prelims.lib.
 Require Import Modules.Prelims.modules.
@@ -74,7 +74,7 @@ Check ((fun a => idpath _):  ∏ a, (rep_ar C a) = (FAr.rep_ar C (toAr a))).
 
 
 (* useless *)
-Lemma half_arity_to_arity_is_rep_weq (a : HalfArity) (M N : rep_ar C a) f : 
+Lemma half_arity_to_arity_is_rep_weq (a : HalfArity) (M N : rep_ar C a) f :
   FAr.rep_ar_mor_law C (a := toAr a) (b:=toAr a) M N (identity _) f
                      ≃
   rep_ar_mor_law C (a :=  a) (b:= a) M N (identity (C := arity_category) _) f.
@@ -150,7 +150,7 @@ Definition sig_to_har_rep_on_mor_weq (R S : a_sig_rep) : a_sig_rep ⟦ R , S ⟧
     split.
     + intro  h .
       intro x.
-      
+
       cbn.
       unfold coproduct_nat_trans_data.
       repeat rewrite id_right.