[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 id-set
⊦ id(apebs0, apebs1, ns) ↔ # apebs0 = # apebs1 ∧ (∀ n. n ∈ ns ∧ n < # apebs0 ∧ n < # apebs1 → apebs0[n] = apebs1[n])
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
idset-idexpt
,
idset-idexpt-fwd
,
idset-mapped-pebs-write-unused
,
idset-refl
,
idset-trans-intersect
,
idset-weaken
,
idset-write-notin
,
Used by units in proved state:
ubi-asm
,
ubi-abs
,
Proof exists?: No