[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 subrec
⊦ a ' + x ⊆m y ↔ a ∈ y ∧ x ⊆m y -1l a
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
del
,
subapp
,
subapp-01
,
subrec-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 19
Used lemmas:
del1-01
,
one-01
,
del1
,
in-05
,
oc-zero
,
notin
,
one
,
ocappend
,
msubset
,
Used spec theorems:
Used simplifier rules:
list
/
a
nat
/
le-num-06
nat-basic
/
a
nat-basic
/
c
nat-basic
/
f
nat
/
le-def
nat-basic
/
add-base
nat
/
ls-le-simp
nat
/
succ-01
nat-basic
/
lf
nat-basic
/
trans-nat
nat
/
pred-03
nat-basic
/
succ
nat
/
sub-ls
nat
/
lels
nat-basic
/
s-04
nat-basic
/
one-01
nat
/
ls-02
nat
/
le-ls-simp