[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 in-01
⊦ a ∈ set2list(s) ↔ a ∈ s
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
dups
,
dups-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
set2list-empty
,
set2list-rec
,
Used spec theorems:
Used simplifier rules:
oset
/
bmin-in
oset
/
bmin-nin
oset
/
min-inn
oset
/
bmin-size-01
nat
/
lels
nat
/
leprf
nat-basic1
/
one-01
nat
/
lels-01
nat
/
ls-01
nat-basic2
/
s
nat-basic1
/
ref-1
nat-basic2
/
a
nat-basic2
/
c
set-basic
/
size-zero
set-basic
/
size-zero-01
list
/
a
list
/
in-17
list
/
in-append
list
/
c
list
/
in-empty
set-basic
/
In-empty