---

Step * of Lemma wellfounded-acyclic-rel

∀[T:Type]. ∀[R:T ⟶ T ⟶ ℙ].  (SWellFounded(x R y) ⇒ acyclic-rel(T;R))
BY
{ (Auto THEN FLemma `rel_plus_strongwellfounded` [-1] THEN Auto) }

1
1. T : Type
2. R : T ⟶ T ⟶ ℙ
3. SWellFounded(x R y)@i
4. SWellFounded(x R+ y)
⊢ acyclic-rel(T;R)

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[R:T  {}\mrightarrow{}  T  {}\mrightarrow{}  \mBbbP{}].    (SWellFounded(x  R  y)  {}\mRightarrow{}  acyclic-rel(T;R))


By

---

Latex:
(Auto  THEN  FLemma  `rel\_plus\_strongwellfounded`  [-1]  THEN  Auto)

---

Home Index