[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 dups-eqsize-02
# x = # y, ¬ dups(x), ∀ a. a ∈ x → a ∈ y ⊦ ¬ dups(y) ∧ (∀ a. a ∈ y → a ∈ x)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
list-perm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 20
Used lemmas:
f-01
,
dups-eqsize-01
,
d
,
rec
,
e-01
,
Used spec theorems:
list
/
In
Used simplifier rules:
list-data
/
size-01
list-data
/
l
list
/
in-empty
list
/
in-01
list
/
in-rec
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
nat-basic2
/
succ
list
/
len-05
list
/
c
list
/
len
list
/
in-append
list
/
a