(* Definition ltb (n m:nat):bool := if beq_nat n m then false else leb n m. Lemma ltb_char n m: ltb n m = true <-> (n<m)%nat. unfold ltb. remember (beq_nat n m). destruct b; symmetry in Heqb; split; intros. inv H. apply beq_nat_true in Heqb. subst. omega. apply beq_nat_false in Heqb. apply leb_complete in H. omega. apply leb_correct. omega. Qed. *)
Function toBlocks (l : Blist) {measure length l} : list Blist :=
(match l with
| nil => nil
| _ :: _ => if leb (List.length l) 511 then [firstn 512 l]
else firstn 512 l :: toBlocks (skipn 512 l)
end)%list.

Lemma toBlocks_injective: forall l1 l2 (BLKS: toBlocks l1 = toBlocks l2)
(F1: InBlocks 512 l1)
(F2: InBlocks 512 l2), l1 = l2.