Add String.length_join and List.length_join

Std/Data/List/Lemmas.lean

@@ -365,6 +365,9 @@ theorem exists_of_mem_join : a ∈ join L → ∃ l, l ∈ L ∧ a ∈ l := mem_
 
 theorem mem_join_of_mem (lL : l ∈ L) (al : a ∈ l) : a ∈ join L := mem_join.2 ⟨l, lL, al⟩
 
+theorem length_join (l : List (List α)) : (join l).length = Nat.sum (l.map length) := by
+  induction l <;> simp [*]
+
 /-! ### bind -/
 
 theorem mem_bind {f : α → List β} {b} {l : List α} : b ∈ l.bind f ↔ ∃ a, a ∈ l ∧ b ∈ f a := by

Std/Data/String/Lemmas.lean

@@ -499,6 +499,11 @@ theorem join_eq (ss : List String) : join ss = ⟨(ss.map data).join⟩ := go ss
 @[simp] theorem data_join (ss : List String) : (join ss).data = (ss.map data).join := by
   rw [join_eq]
 
+@[simp] theorem comp_length_data : List.length ∘ String.data = String.length := rfl
+
+theorem length_join (l : List String) : (String.join l).length = Nat.sum (l.map String.length) := by
+  simp [length, List.length_join, List.map_map]
+
 theorem singleton_eq (c : Char) : singleton c = ⟨[c]⟩ := rfl
 
 @[simp] theorem data_singleton (c : Char) : (singleton c).data = [c] := rfl