Step
*
of Lemma
is-list-wf-list
∀[t:Top List]. (is-list(t) ∈ 𝔹)
BY
{ xxx(InductionOnList THEN RecUnfold `is-list` 0 THEN Reduce 0 THEN RepUR ``cons`` 0 THEN Auto)xxx }
Latex:
Latex:
\mforall{}[t:Top  List].  (is-list(t)  \mmember{}  \mBbbB{})
By
Latex:
xxx(InductionOnList  THEN  RecUnfold  `is-list`  0  THEN  Reduce  0  THEN  RepUR  ``cons``  0  THEN  Auto)xxx
Home
Index