Skip to content

Commit

Permalink
Decrease number of universes
Browse files Browse the repository at this point in the history
Put Fin in lowest universe and 1 universe for FinSeq.
  • Loading branch information
andreaslyn committed Apr 5, 2021
1 parent 6906546 commit 7137029
Show file tree
Hide file tree
Showing 3 changed files with 3 additions and 3 deletions.
2 changes: 1 addition & 1 deletion theories/Spaces/Finite/Fin.v
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@ Local Open Scope nat_scope.

(** A *finite set* is a type that is merely equivalent to the canonical finite set determined by some natural number. There are many equivalent ways to define the canonical finite sets, such as [{ k : nat & k < n}]; we instead choose a recursive one. *)

Fixpoint Fin (n : nat) : Type
Fixpoint Fin (n : nat) : Type0
:= match n with
| 0 => Empty
| S n => Fin n + Unit
Expand Down
2 changes: 1 addition & 1 deletion theories/Spaces/Finite/FinSeq.v
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@ Require Import
Note that the induction principle [finseq_]*)

Definition FinSeq (n : nat) (A : Type) : Type := Fin n -> A.
Definition FinSeq@{u} (n : nat) (A : Type@{u}) : Type@{u} := Fin n -> A.

(** The empty finite sequence. *)

Expand Down
2 changes: 1 addition & 1 deletion theories/Spaces/Finite/Finite.v
Original file line number Diff line number Diff line change
Expand Up @@ -686,7 +686,7 @@ Qed.

(** A function from [nat] to a finite set must repeat itself eventually. *)
Section Enumeration.
Context `{Funext} {X} `{Finite X} (e : nat -> X).
Context `{Funext} {X} `{Finite@{_ Set _} X} (e : nat -> X).

Let er (n : nat) : Fin n -> X
:= fun k => e (nat_fin n k).
Expand Down

0 comments on commit 7137029

Please sign in to comment.