[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 countFun-length
⊦ 0 ≤ i ∧ i ≤ j → # countFun(i, j, intfun) = i→n(1 + j - i)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
countFun-at
,
Used by units in proved state:
int-mod
,
int-fac
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 7
Used lemmas:
countFun-base-01
,
countFun-rec
,
Used spec theorems:
intnat
/
Int2nat-pos
Used simplifier rules:
int-abs
/
forward-le-01
list
/intlista/
a
list
/intlista/
len-02
list
/intlista/
len
intnat
/
rax-04
nat
/
succ-01
intnat
/
labs
int-abs
/
absle
list-data
/intlista/
size-01
int-abs
/
sub-add
nat
/
ls-01
nat-basic2
/
s
nat
/
sub-ls
int-abs
/
succ-01
int-abs
/
numleledel-01
int-abs
/
numle-02
int-abs
/
sub-sub
int-abs
/
sub-add-06
int-basic2
/
add-a
int-basic2
/
add-c
nat-basic2
/
eq-01
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
sub-ls-01
int-basic2
/
add-zero
int-abs
/
succ-02
int-abs
/
lels
int-abs
/
anti
int-abs
/
sub-eq-01
list-data
/intlista/
l
int-abs
/
lels-01
int-abs
/
lenls