[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 subdel-03
⊦ x ⊆m y -1l a ↔ x -l a ⊆m y -l a ∧ (#oc(a, x) < #oc(a, y) ∨ ¬ a ∈ x)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
in-05
,
notin
,
del1
,
oc-zero
,
oc
,
sub-del
,
Used spec theorems:
Used simplifier rules:
nat
/
le-def
nat-basic
/
f
nat-basic
/
lf
nat-basic
/
trans-nat
nat
/
pred-03
nat-basic
/
succ
nat
/
sub-ls
nat-basic
/
a
nat-basic
/
c
nat
/
let
nat
/
lels
list-del
/
del1-del
nat-basic
/
one-01
nat
/
ls-02
nat
/
succ-01
nat
/
le-ls-simp
list-del
/
in-03
list-del
/
in-02-01
nat
/
lez-01