We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 58cfe9f commit bd12c3fCopy full SHA for bd12c3f
data/fin.lean
@@ -6,6 +6,12 @@ namespace fin
6
7
variable {n : ℕ}
8
9
+/-- The greatest value of `fin (n+1)` -/
10
+def last (n : ℕ) : fin (n+1) := ⟨_, n.lt_succ_self⟩
11
+
12
+theorem le_last (i : fin (n+1)) : i ≤ last n :=
13
+le_of_lt_succ i.is_lt
14
15
/-- Embedding of `fin n` in `fin (n+1)` -/
16
def raise (k : fin n) : fin (n + 1) := ⟨val k, lt_succ_of_lt (is_lt k)⟩
17
0 commit comments