[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 in-mkbag-del-two
i ≤ # A, m < i, n < i, n0 < i, n0 ≠ m, n ≠ m, n ≠ n0 ⊦ A[m] ∈ mkbag(A, i) -- A[n] -- A[n0]
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
perm-shift-two
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 37
Used lemmas:
count-del-other
,
count-mkbag-greater-two
,
count-mkbag-greater-one
,
count-mkbag-non-zero
,
count-del-same
,
Used spec theorems:
bag-union
/
in
Used simplifier rules:
nat
/
fle
nat
/
sub-base
nat
/
elim-pred-c
nat-basic
/
oz
nat-basic
/
c
nat-basic
/
a
nat-basic
/
one
nat
/
gr-def
nat-basic
/
f
nat-basic
/
lf-02
nat-basic
/
lf-01
nat-basic
/
ls-02