Step
*
of Lemma
almost-full_wf
∀[T:Type]. ∀[R:T ⟶ T ⟶ ℙ].  (AFx,y:T.R[x;y] ∈ ℙ)
BY
{ ProveWfLemma }
Latex:
Latex:
\mforall{}[T:Type].  \mforall{}[R:T  {}\mrightarrow{}  T  {}\mrightarrow{}  \mBbbP{}].    (AFx,y:T.R[x;y]  \mmember{}  \mBbbP{})
By
Latex:
ProveWfLemma
Home
Index