[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-false
⊦ bits ≠ [] ∧ ¬ bits.first ∧ # bits ≤ n → fillsgn(n + 1, bits) = false ' + fillsgn(n, bits)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 6
Used lemmas:
fillsgn-fill
,
fill-fill
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
z-01
nat
/
lep-01
nat
/
lels
nat
/
eq-01
list-last
/bitlista/
mk-plus
list-last
/bitlista/
mk-two-01
list
/bitlista/
app-01
list-last
/bitlista/
mk-last
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c
nat-basic2
/
c
nat-basic2
/
a
nat
/
lep
nat
/
elim-sub