[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 diff-eq-diff-eq-union
⊦ as2 \ as1 = as3 ∧ as1 \ as0 = as4 ∧ as1 ⊆ as2 ∧ as0 ⊆ as1 → as2 \ as0 = as3 ∪ as4
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 10
Used lemmas:
Used spec theorems:
set-basic
/node-store/
Extension
set-union
/node-store/
unrax
set-union
/node-store/
Difference
Used simplifier rules:
set-basic
/node-store/
sub-trans
set-union
/node-store/
Difference
set-basic
/node-store/
sub-in
set-basic
/node-store/
ne-01