Step
*
of Lemma
is-simplex_wf
No Annotations
∀[k:ℕ]. ∀[L:ℝ^k List].  is-simplex(k;L) ∈ ℙ supposing 0 < ||L||
BY
{ ProveWfLemma }
Latex:
Latex:
No  Annotations
\mforall{}[k:\mBbbN{}].  \mforall{}[L:\mBbbR{}\^{}k  List].    is-simplex(k;L)  \mmember{}  \mBbbP{}  supposing  0  <  ||L||
By
Latex:
ProveWfLemma
Home
Index