[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 fill-rec
⊦ bits ≠ [] ∧ # bits < n → fillsgn(n, bits) = bits.first ' + fillsgn(n -1, bits)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
fill-first
,
fill-last
,
fill-lastn-04
,
fill-lastn-05
,
fill-sgn-02
,
fill-sgn-03
,
Used by units in proved state:
intops
,
int2bits
,
bytes
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 8
Used lemmas:
fillsgn-fill
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
l-02
nat
/
eq-01
list-last
/bitlista/
mk-plus
list-last
/bitlista/
mklist-one
list-last
/bitlista/
mk-last
list
/bitlista/
app-01
nat-basic2
/
l-01
nat
/
lels-03
nat
/
lels-01
nat-basic1
/
ls-02
nat
/
elim-sub
nat
/
succ-01
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c
nat
/
lels
nat-basic2
/
s
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat-basic1
/
f
nat
/
pred-03
list
/bitlista/
app-05
list
/bitlista/
e
list
/bitlista/
a
nat-basic1
/
less-1
nat
/
elim-pred-c