[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 put-del1-in
⊦ x[m] ≠ a ∧ m < # x → (a ∈ x[m, a] -1l a ↔ a ∈ x)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
list-perm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 9
Used lemmas:
put-in-02
,
put-in
,
del1-in
,
del1-n
,
get-succ
,
del1-y
,
put-zero
,
get-zero-01
,
put-rec
,
Used spec theorems:
Used simplifier rules:
list
/
in-empty
list-data
/
size-01
nat-basic1
/
zero-01
nat
/
lels
nat-basic2
/
s
nat-basic2
/
succ
list
/
len-05
list
/
in-rec
list
/
c
list
/
e-01
nat
/
pred-03
list
/
c-07
list
/
c-08
nat
/
elim-pred-c
list-data
/
l
nat-basic1
/
f
nat
/
succ-01
nat-basic2
/
oz
nat-basic2
/
c
nat-basic2
/
a
list
/
in-01
list
/
a