Step
*
2
2
1
of Lemma
satisfies-shadow_inequalities
1. [n] : {2...}
2. u : {L:ℤ List| ||L|| = n ∈ ℤ}
3. v : {L:ℤ List| ||L|| = n ∈ ℤ} List
4. xs : ℤ List
5. (∀as∈[u / v].xs ⋅ as ≥0)
6. i : ℕn - 1
7. index-of-min(max_tl_coeffs([u / v])) = i ∈ ℕn - 1
⊢ ∃xs:ℤ List. (∀as∈shadow-inequalities(i + 1;[u / v]).xs ⋅ as ≥0)
BY
{ TACTIC:(With ⌜xs\i + 1⌝ (D 0)⋅ THEN Auto) }
1
1. [n] : {2...}
2. u : {L:ℤ List| ||L|| = n ∈ ℤ}
3. v : {L:ℤ List| ||L|| = n ∈ ℤ} List
4. xs : ℤ List
5. (∀as∈[u / v].xs ⋅ as ≥0)
6. i : ℕn - 1
7. index-of-min(max_tl_coeffs([u / v])) = i ∈ ℕn - 1
⊢ (∀as∈shadow-inequalities(i + 1;[u / v]).xs\i + 1 ⋅ as ≥0)
Latex:
Latex:
1. [n] : \{2...\}
2. u : \{L:\mBbbZ{} List| ||L|| = n\}
3. v : \{L:\mBbbZ{} List| ||L|| = n\} List
4. xs : \mBbbZ{} List
5. (\mforall{}as\mmember{}[u / v].xs \mcdot{} as \mgeq{}0)
6. i : \mBbbN{}n - 1
7. index-of-min(max\_tl\_coeffs([u / v])) = i
\mvdash{} \mexists{}xs:\mBbbZ{} List. (\mforall{}as\mmember{}shadow-inequalities(i + 1;[u / v]).xs \mcdot{} as \mgeq{}0)
By
Latex:
TACTIC:(With \mkleeneopen{}xs\mbackslash{}i + 1\mkleeneclose{} (D 0)\mcdot{} THEN Auto)
Home
Index