---

Step * 1 of Lemma satisfies-negate-poly-constraints

.....assertion..... 
∀f:ℤ ⟶ ℤ. ∀L:polynomial-constraints() List.
  ((∃X∈negate-poly-constraints(L). satisfies-poly-constraints(f;X))
  ⇐⇒ (∀X∈L.(∃Z∈negate-poly-constraint(X). satisfies-poly-constraints(f;Z))))
BY
{ ((UnivCD THENA Auto) THEN D -1) }

1
1. f : ℤ ⟶ ℤ
⊢ (∃X∈negate-poly-constraints([]). satisfies-poly-constraints(f;X))
⇐⇒ (∀X∈[].(∃Z∈negate-poly-constraint(X). satisfies-poly-constraints(f;Z)))

2
1. f : ℤ ⟶ ℤ
2. u : polynomial-constraints()
3. v : polynomial-constraints() List
⊢ (∃X∈negate-poly-constraints([u / v]). satisfies-poly-constraints(f;X))
⇐⇒ (∀X∈[u / v].(∃Z∈negate-poly-constraint(X). satisfies-poly-constraints(f;Z)))

---

Latex:

---

Latex:
.....assertion..... 
\mforall{}f:\mBbbZ{}  {}\mrightarrow{}  \mBbbZ{}.  \mforall{}L:polynomial-constraints()  List.
    ((\mexists{}X\mmember{}negate-poly-constraints(L).  satisfies-poly-constraints(f;X))
    \mLeftarrow{}{}\mRightarrow{}  (\mforall{}X\mmember{}L.(\mexists{}Z\mmember{}negate-poly-constraint(X).  satisfies-poly-constraints(f;Z))))


By

---

Latex:
((UnivCD  THENA  Auto)  THEN  D  -1)

---

Home Index