Step
*
of Lemma
poss-maj-length2
∀[T:Type]. ∀[eq:EqDecider(T)]. ∀[L:T List]. ∀[x:T]. ∀[n:ℤ].  n ≤ ||L|| supposing (fst(poss-maj(eq;L;x))) = n ∈ ℤ
BY
{ (Auto THEN InstLemma `poss-maj-length` [⌜T⌝;⌜eq⌝;⌜L⌝;⌜x⌝]⋅ THEN Auto) }
Latex:
Latex:
\mforall{}[T:Type].  \mforall{}[eq:EqDecider(T)].  \mforall{}[L:T  List].  \mforall{}[x:T].  \mforall{}[n:\mBbbZ{}].
    n  \mleq{}  ||L||  supposing  (fst(poss-maj(eq;L;x)))  =  n
By
Latex:
(Auto  THEN  InstLemma  `poss-maj-length`  [\mkleeneopen{}T\mkleeneclose{};\mkleeneopen{}eq\mkleeneclose{};\mkleeneopen{}L\mkleeneclose{};\mkleeneopen{}x\mkleeneclose{}]\mcdot{}  THEN  Auto)
Home
Index