[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 countrefs-le
⊦ # refs = i→n(countrefs(i ' + ints)) ∧ 0 < i → ¬ # refs ≤ # refs - i→n(countrefs(ints))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
countrefs-le-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
countrefs-ls
,
countrefs-not-zero
,
countrefs-not-zero-01
,
Used spec theorems:
int-abs
/
absls-02
int-abs
/
absle
int-abs
/
numabspos
Used simplifier rules:
nat
/
lep
nat-basic2
/
a
nat-basic2
/
c
nat
/
lep-01
nat
/
let
list
/intlista/
a
int-abs
/
abs-06
int-abs
/
forward-le-01
int-basic1
/
forward-pos
oelem
/intlista/
transitivity
int-abs
/
anti
int-abs
/
lels
int-abs
/
lels-01
int-abs
/
forward-lsle
int-abs
/
forward-lels
int-abs
/
forward-le-04
intnat
/
labs
intnat
/
abs-zero
nat-basic1
/
f
nat-basic1
/
lf-02
nat
/
lels-01
int-abs
/
forward-le-05
nat
/
elim-sub