[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-sw-in
⊦ m < # x ∧ n < # x → (a ∈ x[m, x[n]][n, x[m]] ↔ 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: 5
Proof steps: 15
Used lemmas:
get-in
,
put-in
,
put-succ
,
put-zero
,
get-zero-01
,
get-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-01
list
/
c-07
nat
/
elim-pred-c
list-data
/
l
nat-basic1
/
f
list
/
e-01
nat
/
lez
nat
/
succ-01
list
/
in-rec
list
/
a
list
/
c
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz