---

Step * of Lemma trivial-biject-exists

∀[T:Type]. ∃f:T ⟶ T. Bij(T;T;f)
BY
{ (Auto THEN D 0 With ⌜λx.x⌝  THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mexists{}f:T  {}\mrightarrow{}  T.  Bij(T;T;f)


By

---

Latex:
(Auto  THEN  D  0  With  \mkleeneopen{}\mlambda{}x.x\mkleeneclose{}    THEN  Auto)

---

Home Index