---

Step * of Lemma l_member_length

∀[T:Type]. ∀[L:T List]. ∀[x:T].  0 < ||L|| supposing (x ∈ L)
BY
{ (((InstLemma `non_nil_length` [] THEN RepeatFor 2 (ParallelLast')) THEN Auto)
   THEN BackThruSomeHyp
   THEN InstLemma `l_member_non_nil` [⌜T⌝;⌜x⌝;⌜L⌝]⋅
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[L:T  List].  \mforall{}[x:T].    0  <  ||L||  supposing  (x  \mmember{}  L)


By

---

Latex:
(((InstLemma  `non\_nil\_length`  []  THEN  RepeatFor  2  (ParallelLast'))  THEN  Auto)
  THEN  BackThruSomeHyp
  THEN  InstLemma  `l\_member\_non\_nil`  [\mkleeneopen{}T\mkleeneclose{};\mkleeneopen{}x\mkleeneclose{};\mkleeneopen{}L\mkleeneclose{}]\mcdot{}
  THEN  Auto)

---

Home Index