[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 transaction-prefix
⊦ transaction-prefix(ndx, gndx) ↔ # gndx < # ndx ∧ (gndx = [] ∨ gndx.head.start ∧ (∀ n. (0 < n ∧ n < # gndx → ¬ gndx[n].start) ∧ (n < # gndx → ¬ gndx[n].end))) ∧ (∀ n. n < # gndx → gndx[n].nd = ndx[n])
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
transaction-prefix-app
,
transaction-prefix-app-last
,
transaction-prefix-app-nonlast
,
transaction-prefix-empty
,
transaction-prefix-is-transaction-prefix
,
transaction-prefix-last-nonend
,
Used by units in proved state:
Proof exists?: No