[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-next
m < # apebs ⊦ valid-global-sqn(subarray(apebs, 0, m), n) → (valid-global-sqn(subarray(apebs, 0, m + 1), n) ↔ ¬ valid-peb(apebs[m]) ∨ apebs[m].vidhdr.sqn < 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: 4
Proof steps: 17
Used lemmas:
valid-global-sqn
,
Used spec theorems:
valid-peb
/
valid-peb0
bag-max
/
max-rec
Used simplifier rules:
nat
/
lels-03
sqns
/
valid-sqns-rec
sqns
/
valid-sqns-subarray
nat-basic
/
c
nat-basic
/
a
nat
/
ls-le-simp
nat
/
succ-01
apeb
/
elim
nat
/
lels
nat
/
gr-def
nat-basic
/
lf
oelem
/nat-set/
transitivity
nat
/
fle-01
nat-basic
/
ls-02
bag-max
/
max-add-smaller
valid-peb
/
valid-peb-imp-valid-peb0
valid-peb
/
valid-peb-unique
bag-max
/
bag-add-nonempty
bag-max
/
bag-union-one
nat
/
fle
nat-basic
/
f
bag-max
/
max-one
oelem
/nat-set/
irreflexivity
bag-union
/nat-bag/
union-com
bag-union
/nat-bag/
union-ass
bag-union
/nat-bag/
union-empty
nat
/
le-ls-simp