[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 sgn-ex
⊦ bits ≠ [] ↔ (∃ n. bits = mklist(bits.first, n) + sgn(bits) ∧ bits ≠ [])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
fill-sgn
,
Used by units in proved state:
int2bits
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
sgn-base-01
,
sgn-base-02
,
sgn-rec-01
,
sgn-one
,
sgn-empty
,
Used spec theorems:
Used simplifier rules:
list-last
/bitlista/
mk-plus
list-last
/bitlista/
mklist-one
nat-basic2
/
a
nat-basic2
/
c
list-last
/bitlista/
mk-in
list
/bitlista/
in-append
list
/bitlista/
in-14
list
/bitlista/
app-01
list
/bitlista/
app-03
list
/bitlista/
app-05
list
/bitlista/
c-08
list
/bitlista/
e
list
/bitlista/
app-02-ant
list-last
/bitlista/
mk-last
list
/bitlista/
app-04
list
/bitlista/
e-01
list
/bitlista/
c
list-last
/bitlista/
mk-empty
list
/bitlista/
a
list
/bitlista/
app
list-data
/bitlista/
elim-list-c