Step
*
of Lemma
unsquashed-seq-cont_wf
∀[T:Type]. ∀[F:(ℕ ⟶ T) ⟶ ℕ].  (unsquashed-seq-cont(T;F) ∈ ℙ)
BY
{ ProveWfLemma }
Latex:
Latex:
\mforall{}[T:Type].  \mforall{}[F:(\mBbbN{}  {}\mrightarrow{}  T)  {}\mrightarrow{}  \mBbbN{}].    (unsquashed-seq-cont(T;F)  \mmember{}  \mBbbP{})
By
Latex:
ProveWfLemma
Home
Index