proposition: Lemma F_wf_solve_dec1 : forall wpb lpb', o_lpb lpb' (wpb :: lpb').
proof: Proof. intros wpb lpb'; unfold o_lpb. apply (@NatMul.rmv_case lt (map wfpb_weight lpb') (map wfpb_weight (wpb :: lpb')) (map wfpb_weight lpb') nil (wfpb_weight wpb)). contradiction. apply NatMul.LP.permut_refl. apply NatMul.LP.permut_refl. Qed.
imports: Coq(Arith List Wellfounded Wf_nat) CoLoR(more_list list_permut list_sort term_spec term_o equational_theory ac matching dickson matching_well_formed matching_well_founded matching_sound matching_complete dickson)