---

Step * of Lemma firstn_last_sq

∀[T:Type]. ∀[L:T List].  L ~ firstn(||L|| - 1;L) @ [last(L)] supposing (¬↑null(L)) ∧ (T ⊆r Base)
BY
{ (Auto THEN InstLemma `firstn_last` [⌜T⌝;⌜L⌝] ⋅ THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[L:T  List].    L  \msim{}  firstn(||L||  -  1;L)  @  [last(L)]  supposing  (\mneg{}\muparrow{}null(L))  \mwedge{}  (T  \msubseteq{}r  Base)


By

---

Latex:
(Auto  THEN  InstLemma  `firstn\_last`  [\mkleeneopen{}T\mkleeneclose{};\mkleeneopen{}L\mkleeneclose{}]  \mcdot{}  THEN  Auto)

---

Home Index