[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-all
⊦ perm(x, y) ↔ (∀ a. a ∈ x ∨ a ∈ y → #oc(a, x) = #oc(a, y))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
del-04
,
del-05
,
perm-del-01
,
perm-put-del1
,
perm-switch
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
notin
,
oc-zero
,
msubset
,
perm
,
Used spec theorems:
Used simplifier rules:
nat
/
lels-02
nat
/
le-ls-simp
nat
/
ler
nat-basic1
/
ref-1
nat-basic1
/
f
nat
/
lels-01
nat-basic1
/
lf-02
nat-basic1
/
lf-01
nat-basic1
/
ls-02