Step
*
of Lemma
strongwellfounded_wf
∀[T:Type]. ∀[R:T ⟶ T ⟶ Type].  (SWellFounded(R[x;y]) ∈ ℙ)
BY
{ (Unfold `strongwellfounded` 0 THEN Auto) }
Latex:
Latex:
\mforall{}[T:Type].  \mforall{}[R:T  {}\mrightarrow{}  T  {}\mrightarrow{}  Type].    (SWellFounded(R[x;y])  \mmember{}  \mBbbP{})
By
Latex:
(Unfold  `strongwellfounded`  0  THEN  Auto)
Home
Index