[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 bagle-count
⊦ count(n, bag< m) = ((n < m ⊃ 1; 0))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bagle-in
,
sar-elems-bagle-twice-same
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 12
Used lemmas:
bagle-rec
,
bagle-base
,
Used spec theorems:
bag-basic
/suffix-array-base/
count-insert
Used simplifier rules:
nat-basic1
/
ls-02
nat-basic1
/
f
nat-basic1
/
neq-01
nat-basic2
/
ax-08
nat-basic2
/
one
nat-basic1
/
ref-1
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
nat-basic2
/
succ
bag-basic
/suffix-array-base/
count-empty
nat-basic1
/
zero-01