[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-in-01
⊦ bits ≠ [] → (boolvar ∈ sgn(bits) ↔ boolvar ∈ bits)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
sgn-first-04
,
sgn-in-02
,
sgn-notsame
,
sgn-notsame-01
,
Used by units in proved state:
intops
,
int2bits
,
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 12
Used lemmas:
sgn-base-01
,
sgn-base-02
,
sgn-rec-01
,
sgn-one
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
in-01
list
/bitlista/
in-append
list-data
/bitlista/
elim-list-c
list
/bitlista/
in-empty
list
/bitlista/
in-17
list
/bitlista/
app
list
/bitlista/
in-06
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c