proposition: Lemma bv_slt_B2P: forall x y, bv_slt x y = true <-> bv_sltP x y.
proof: Proof. intros. split; intros; unfold bv_slt, bv_sltP in *. case_eq (size x =? size y)%N; intros; rewrite H0 in H; unfold slt_listP. now rewrite H. now contradict H. unfold slt_listP in *. case_eq (size x =? size y)%N; intros. rewrite H0 in H. case_eq (slt_list x y); intros. easy. rewrite H1 in H. now contradict H. rewrite H0 in H. now contradict H. Qed.
imports: List Bool NArith Psatz Int63 Nnat ZArith Misc ProofIrrelevance