[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 succ-fill
⊦ false ∈ bits.rest ∧ bits ≠ [] → fillsgn(n, bits) +1 = fillsgn(n, bits +1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
int2bits
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 12
Used lemmas:
succ-len
,
fillsgn-fill
,
fillsgn-longer
,
succ-zero-01
,
Used spec theorems:
Used simplifier rules:
nat
/
le-ls-simp
nat
/
lep-01
nat
/
lels
nat
/
eq-01
list
/bitlista/
app-01
nat-basic1
/
one
nat-basic2
/
l
nat-basic2
/
l-01
nat
/
lels-03
nat-basic1
/
ls-02
nat
/
elim-sub
nat-basic2
/
nls-fst
nat-basic2
/
a
nat-basic2
/
c
nat-basic1
/
f
nat
/
lels-01
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c