fact: Fixpoint mset_sem (φ : nat -> list nat) (A : mset_term) : list nat := match A with | mset_term_zero => [0] | mset_term_var x => φ x | mset_term_plus A B => (mset_sem φ A) ++ (mset_sem φ B) | mset_term_h A => map S (mset_sem φ A) end.
imports: Arith Lia List Permutation Undecidability.SetConstraints.FMsetC Undecidability.SetConstraints.Util.Facts Undecidability.Synthetic.Definitions ssreflect ssrbool ssrfun