Step
*
of Lemma
is-path_wf
∀[T:Type]. ∀[A:(T List) ⟶ ℙ]. ∀[f:ℕ ⟶ T].  (is-path(A;f) ∈ ℙ)
BY
{ ProveWfLemma }
Latex:
Latex:
\mforall{}[T:Type].  \mforall{}[A:(T  List)  {}\mrightarrow{}  \mBbbP{}].  \mforall{}[f:\mBbbN{}  {}\mrightarrow{}  T].    (is-path(A;f)  \mmember{}  \mBbbP{})
By
Latex:
ProveWfLemma
Home
Index