[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 perm-put
⊦ n < # y → (perm(x, y[n, a]) ↔ a ∈ x ∧ perm(x -1l a, y -1l y[n]))
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: 4
Proof steps: 11
Used lemmas:
del-02
,
perm-put-del1
,
perm-del
,
sym-02
,
in
,
ref
,
trans
,
sym-01
,
Used spec theorems:
Used simplifier rules:
list-data
/
l
nat-basic1
/
f
list-del
/
put-in-02