[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 succ-zero-03
⊦ bits ≠ [] ∧ ¬ bits.last → bits +1 = bits.butlast + true
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
succ-falsein-02
,
Used by units in proved state:
int2bits
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
succ-zero
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
e-02
list
/bitlista/
a
list
/bitlista/
Last
list
/bitlista/
app-01
list-last
/bitlista/
last-elim