[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 k-union-rec-n
⊦ ¬(a ∈ x ∨ a ∈ y) → (a + x) ∪ y = a + (x ∪ y)
Type: A user defined theorem
Validity: The proof is valid.
Features: kodkodax,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
assoc
,
union
,
Used spec theorems:
list-dup
/
rmdup-n
Used simplifier rules:
list
/
c
list
/
app-01
list-dup
/
rmdup-y
list
/
app-05
list
/
e
list
/
in-append
list
/
a