Step * 1 1 1 2 1 1 of Lemma satisfies-negate-poly-constraint

.....assertion..... 
1. eqs iPolynomial() List
2. ineqs iPolynomial() List
3. : ℤ ⟶ ℤ
4. (∀p∈eqs.int_term_value(f;ipolynomial-term(p)) 0 ∈ ℤ)
⊢ Dec((∀p∈ineqs.0 ≤ int_term_value(f;ipolynomial-term(p))))
BY
(Unfold `l_all` THEN Auto) }


Latex:


Latex:
.....assertion..... 
1.  eqs  :  iPolynomial()  List
2.  ineqs  :  iPolynomial()  List
3.  f  :  \mBbbZ{}  {}\mrightarrow{}  \mBbbZ{}
4.  (\mforall{}p\mmember{}eqs.int\_term\_value(f;ipolynomial-term(p))  =  0)
\mvdash{}  Dec((\mforall{}p\mmember{}ineqs.0  \mleq{}  int\_term\_value(f;ipolynomial-term(p))))


By


Latex:
(Unfold  `l\_all`  0  THEN  Auto)




Home Index