[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 len-06
⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0)
Type: A user defined theorem
Validity: The proof is valid.
Features: ws,
Comment:
Used by:
Used by units in proved state:
list-del
,
rowcol-upd
,
olist
,
string-less
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
a
,
len
,
len-01
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
eq-01
nat-basic
/
a
nat-basic
/
c