---

Step * 1 1 of Lemma poly-int-value


1. k : ℕ
2. ∀k:ℕk. ∀[p:tree(ℤ)]. (∀[l:Top List]. (p@l = p@[] ∈ ℤ)) supposing ((↑poly-int(p)) and (tree_size(p) ≤ k))
3. p1 : ℤ
4. tree_size(tree_leaf(p1)) ≤ k
5. ↑poly-int(tree_leaf(p1))
6. l : Top List
⊢ tree_leaf(p1)@l = tree_leaf(p1)@[] ∈ ℤ
BY
{ (RepUR ``poly-int-val poly-val-fun`` 0 THEN Auto) }

---

Latex:

---

Latex:

1.  k  :  \mBbbN{}
2.  \mforall{}k:\mBbbN{}k
          \mforall{}[p:tree(\mBbbZ{})].  (\mforall{}[l:Top  List].  (p@l  =  p@[]))  supposing  ((\muparrow{}poly-int(p))  and  (tree\_size(p)  \mleq{}  k))
3.  p1  :  \mBbbZ{}
4.  tree\_size(tree\_leaf(p1))  \mleq{}  k
5.  \muparrow{}poly-int(tree\_leaf(p1))
6.  l  :  Top  List
\mvdash{}  tree\_leaf(p1)@l  =  tree\_leaf(p1)@[]


By

---

Latex:
(RepUR  ``poly-int-val  poly-val-fun``  0  THEN  Auto)

---

Home Index