[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem exists-max0column
#c mx ≠ 0 ⊦ ∃ c. c < #c mx ∧ (∀ c0. c0 < #c mx → count(mx[c0]c, λ j. j < i) ≤ count(mx[c]c, λ j. j < i))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
scolsort-dirtyboundhalf
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
exists-max0column-ind
,
Used spec theorems:
Used simplifier rules:
nat
/
le-def
nat-basic
/
one-01
nat
/
ls-01
nat-basic
/
s-04
nat-basic
/
refl-nat
nat-basic
/
a
nat-basic
/
c
nat-basic
/
f
nat
/
succ-01
nat
/
ls-02