[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 fillsgn-fill
⊦ # bits < n → fillsgn(n, boolvar ' + bits) = mklist(boolvar, n - # bits) + bits
Type: An axiom
Validity: The proof is valid.
Features: simp,
Comment:
Used by:
fill-fill
,
fill-length
,
fill-rec
,
fill-rec-false
,
fill-rec-one
,
fill-sgn-01
,
inv-fill
,
succ-fill
,
Used by units in proved state:
intops
,
Proof exists?: No