[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 abs-log-no-change-eq
⊦ (∀ n. (n ∈ gstore0 ↔ n ∈ gstore1) ∧ (n ∈ gstore0 → gstore1[n].gndlist = gstore0[n].gndlist ∧ gstore1[n].ladrlist = gstore0[n].ladrlist)) → abs-log(nx, gstore0) = abs-log(nx, gstore1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
gjournal-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 9
Used lemmas:
abs-log-rec
,
abs-log-base
,
Used spec theorems:
Used simplifier rules:
list
/nat-list-set/
a
list
/nat-list-set/
c
ablock
/group-store/
elim
list
/address-list-set/
a
ablock-store-inv
/group-store/
to-adrs-eq
list
/address-list-set/
app-03
ablock
/group-store/
sel-01
ablock
/group-store/
sel-02
store
/group-store-ablock-store-nat-store/
notmemlookup
ablock
/group-store/
inj