[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 mtd-cons-extract
⊦ n < # pebs → (mtd-cons(pebs) ↔ mtd-valid-peb(pebs[n]) ∧ mtd-cons(pebs))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 4
Used lemmas:
mtd-valid-peb
,
mtd-cons
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
peb
/
elim
peb
/
sel-07
peb
/
sel-05
peb
/
sel-06