[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 ocs-del-del1
⊦ #oc(a, x) = 1 → x -l a = x -1l a
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 5
Used lemmas:
one-01
,
oc-zero
,
one
,
ocappend
,
oc-e
,
Used spec theorems:
Used simplifier rules:
list
/
c
nat-basic2
/
one-03
list-del
/
del-y
list-del
/
in-03
list-del
/
del1-y
list
/
app-08
list-del
/
del1-n
list
/
a
list-del
/
del-n
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
add-base