[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-global-sqn-add-valid
m < # apebs ⊦ valid-peb(apeb) ∧ valid-global-sqn(apebs, n) ∧ apeb.vidhdr.sqn < n → valid-global-sqn(apebs[m, apeb], n)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 18
Used lemmas:
valid-global-sqn
,
Used spec theorems:
sqns
/
valid-sqns-write
bag-max
/
max-rec
Used simplifier rules:
apeb
/
elim
bag-union
/nat-bag/
subset-emp
bag-union
/nat-bag/
union-diff-distr
bag-union
/nat-bag/
diff-empty1
bag-max
/
bag-single-max
bag-union
/nat-bag/
diff-empty
apeb
/
sel-05
valid-peb
/
valid-peb0-imp-valid-peb
bag-max
/
max-rec-simp
sqns
/
valid-peb-sqns-nonempty
nat
/
ls-le-simp
nat
/
lels
bag-max
/
bag-diff-one
bag-max
/
max-add-smaller
nat
/
fle
bag-union
/nat-bag/
union-empty
bag-max
/
bag-add-nonempty
bag-union
/nat-bag/
union-com
bag-union
/nat-bag/
union-ass
bag-max
/
bag-union-one
valid-peb
/
valid-peb-unique
nat-basic
/
f
nat
/
gr-def
bag-max
/
max-rem-ls
oelem
/nat-set/
irreflexivity