---

Step * of Lemma strict-fun-connected_irreflexivity

∀[T:Type]. ∀[f:T ⟶ T]. ∀[x:T].  False supposing x = f+(x)
BY
{ (Unfold `strict-fun-connected` 0 THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[f:T  {}\mrightarrow{}  T].  \mforall{}[x:T].    False  supposing  x  =  f+(x)


By

---

Latex:
(Unfold  `strict-fun-connected`  0  THEN  Auto)

---

Home Index