[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 size-perm
# x = # y, ¬ dups(x), ∀ a. a ∈ x → a ∈ y ⊦ perm(x, y)
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: 2
Proof steps: 10
Used lemmas:
notin
,
oc-zero
,
oc-dups
,
msubset
,
perm-def
,
Used spec theorems:
list-dup
/
dups-eqsize-02
Used simplifier rules:
nat-basic1
/
zero
nat-basic1
/
one-01
nat-basic1
/
lf-01
nat-basic1
/
f
nat
/
lels-01