[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 ubi-io-initial
⊦ ubi-io-initial(pebs) ↔ (∀ n. n < # pebs → ubi-io-peb-initial(pebs[n]))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
reduce-initial
,
Used by units in proved state:
ubi-io-refine
,
ubi-io-asm
,
Proof exists?: No