[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 unique-sqns-update
m < # apebs ⊦ unique-sqns(apebs) → ( unique-sqns(apebs[m, apeb]) ↔ ¬ valid-peb(apeb) ∨ ¬ apeb.vidhdr.sqn ∈ valid-sqns(apeb.vidhdr.vol, apeb.vidhdr.leb, apebs) \ (valid-peb(apeb.vidhdr.vol, apeb.vidhdr.leb, apebs[m]) ⊃ {apebs[m].vidhdr.sqn} ;∅))
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: 7
Proof steps: 22
Used lemmas:
unique-sqns
,
Used spec theorems:
valid-peb
/
valid-peb0
sqns
/
valid-sqns-write
Used simplifier rules:
nat-basic
/
f
apeb
/
elim
apeb
/
sel-05
valid-peb
/
valid-peb-unique
bag-max
/
unique-elems-rem
bag-max
/
unique-elems-rem-notin
bag-union
/nat-bag/
union-empty
bag-union
/nat-bag/
union-ass
bag-union
/nat-bag/
union-com
bag-max
/
bag-diff-one
bag-max
/
bag-union-one
bag-max
/
unique-elems-add
valid-peb
/
valid-peb-imp-valid-peb0
valid-peb
/
valid-peb-vol
valid-peb
/
valid-peb-leb
bag-union
/nat-bag/
diff-empty