proposition: Lemma wf_order : forall m m', hmap_order m m' -> wf m -> wf m'.
proof: Proof. intros. destruct H0 ; constructor. apply H in wf_false0; auto. apply H in wf_true0; auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause