[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 del1
⊦ a ∈ x → #oc(a, x -1l a) = #oc(a, x) -1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
ad
,
del
,
del-02
,
del-04
,
del-05
,
delapp
,
oc-del
,
oc-del-01
,
oc-del-02
,
ocs-del1-if
,
perm-put-del1
,
subdel-01
,
subdel-02
,
subdel-03
,
subrec
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 6
Used lemmas:
oc-n
,
one-01
,
one
,
ocappend
,
oc-e
,
in-05
,
Used spec theorems:
Used simplifier rules:
nat
/
pred-03
nat
/
elim-pred-c
nat-basic2
/
z-01
list-del
/
del1-n
nat-basic2
/
add-base
list-del
/
del1-y
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
list
/
in-rec
list
/
a
list
/
c