[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 sub-del
⊦ #oc(a, x) ≤ #oc(a, y) → (x ⊆m y ↔ x -l a ⊆m y -l a)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
subdel-02
,
subdel-03
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 9
Used lemmas:
in-05
,
ocs-del-length
,
oc-zero
,
msubset
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
list-del
/
in-del-new
nat
/
le-def
nat
/
ls-le-simp