[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 valid-sqns-write-h
⊦ m0 ≤ # apebs → valid-sqns(v, m, apebs[n, apeb], m0) = (n < m0 ⊃ (valid-sqns(v, m, apebs, m0) \ (valid-peb(v, m, apebs[n]) ⊃ {apebs[n].vidhdr.sqn} ;∅)) ∪ (valid-peb(v, m, apeb) ⊃ {apeb.vidhdr.sqn} ;∅) ;valid-sqns(v, m, apebs, m0) )
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
valid-sqns-write
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 26
Used lemmas:
valid-peb-in-sqnums-h
,
valid-sqns-rec
,
valid-sqns-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
zero-01
nat
/
succ-01
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat
/
lels
nat
/
ls-le-simp
bag-union
/nat-bag/
union-diff-distr
array
/apebs/
Size-put
nat-basic
/
ref
array
/apebs/
Put-same
bag-union
/nat-bag/
union-diff-cancel
bag-union
/nat-bag/
union-inj
array
/apebs/
Put-other
apeb
/
elim
nat-basic
/
succ
nat-basic
/
trans
nat-basic
/
lf
nat-basic
/
f
bag-union
/nat-bag/
diff-empty
bag-union
/nat-bag/
del-rec
bag-max
/
bag-diff-one
bag-union
/nat-bag/
union-rec
bag-basic
/nat-bag/
insert-inj
valid-peb
/
valid-peb-unique
bag-max
/
bag-union-one
bag-basic
/nat-bag/
bag-add2-eq-elim
bag-union
/nat-bag/
union-com
bag-union
/nat-bag/
union-ass
bag-union
/nat-bag/
union-empty
bag-max
/
bag-remadd-in
nat
/
lels-03
nat-basic
/
ls-02
nat-basic
/
neq-01