[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 ordered-count-splits
ordered≤(x), n < # x ⊦ n < count(x, λ b. b < a) ↔ x[n] < a
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 21
Used lemmas:
Used spec theorems:
list-del
/
get-append-less
olist
/
orderedle-ls
filter-count
/
count-zero
Used simplifier rules:
list-data
/
l
nat-basic
/
f
olist
/
cons-02
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/
a
nat-basic
/
succ
list
/
len-05
list
/
c
filter-count
/
count-rec
list
/
e-01
nat-basic
/
one-01
list
/
len-02
list-del
/
get-append-grt
nat
/
elim-pred-c
nat
/
succ-01
nat-basic
/
oz
nat-basic
/
l
nat-basic
/
add-base
nat-basic
/
nls-fst
nat-basic
/
refl-nat
nat
/
fle
nat
/
les
nat-basic
/
lf-01
nat
/
eqle-one
list-del
/
get-in
weakord
/tord/
nll
weakord
/tord/
leq-trans
nat
/
lez
nat-basic
/
zero
list-del
/
one-03
weakord
/tord/
irreflexivity
filter-count
/
count-base