proposition: Lemma wlt_wlt_gen : forall (a:nat) (w1 w2:list nat), (length w1) = (length w2) -> (wlt w1 w2) -> (wlt (cons a w1) (cons a w2)).
proof: Proof. destruct a. intros. apply wlt_0_w. apply wlt_w_0. assumption. intros. apply wlt_wlt; assumption. Qed.
imports: Arith Coq.Logic.Eqdep_dec Coq.Arith.Peano_dec List Recdef