---

Step * 1 1 1 1 1 of Lemma unsat-omega_start


1. n : ℕ
2. xs : ℤ List
3. (∀as∈[].xs ⋅ as =0)
4. (∀bs∈[].xs ⋅ bs ≥0)
⊢ xs |= case gcd-reduce-ineq-constraints([];[]) of inl(ineqs') => inl <[], ineqs'> | inr(x) => inr x 
BY
{ (RepUR ``gcd-reduce-ineq-constraints satisfies-int-constraint-problem`` 0 THEN Auto) }

---

Latex:

---

Latex:

1.  n  :  \mBbbN{}
2.  xs  :  \mBbbZ{}  List
3.  (\mforall{}as\mmember{}[].xs  \mcdot{}  as  =0)
4.  (\mforall{}bs\mmember{}[].xs  \mcdot{}  bs  \mgeq{}0)
\mvdash{}  xs  |=  case  gcd-reduce-ineq-constraints([];[])  of  inl(ineqs')  =>  inl  <[],  ineqs'>  |  inr(x)  =>  inr  x\000C 


By

---

Latex:
(RepUR  ``gcd-reduce-ineq-constraints  satisfies-int-constraint-problem``  0  THEN  Auto)

---

Home Index