[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 insert-subset-old
⊦ ks ⊆ ks0 → (ks ++ key ⊆ ks0 ∪ ks1 ↔ key ∈ ks0 ∨ key ∈ ks1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
Used spec theorems:
set-union
/node-index/
subdef
Used simplifier rules:
set-basic
/node-index/
sub-add-03
set-union
/node-index/
sub-union
set-union
/node-index/
unin
set-basic
/node-index/
In-insert
set-union
/node-index/
unin-01
set-union
/node-index/
una
set-union
/node-index/
unc
set-basic
/node-index/
sub-in
set-basic
/node-index/
ne-01