[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 read-split

⊦ fs[ax] = ndx0 + ndx1 ↔ (∃ ax0, ax1. ax = ax0 + ax1 ∧ fs[ax0] = ndx0 ∧ fs[ax1] = ndx1)

Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state: gjournal-refine, gjournal-base,
Proof exists?: Yes

View the proof

Infos about the proof

Proved?: Yes
Interactions: 2
Proof steps: 10
Used lemmas: read-rec, read-eq-empty, read-base, read-app,
Used spec theorems:
- Used simplifier rules:
  - list/node-list/app-01
  - list/node-list/app-02
  - list/node-list/in-append
  - list/node-list/in-14
  - list/address-list-set/c
  - list/node-list/in-append0-not-left
  - list/address-list-set/Nil
  - list/node-list/Nil
  - list/node-list/in-empty
  - list/node-list/in-rec
  - list/node-list/c-06
  - list/address-list-set/a
  - list/node-list/c
  - list/node-list/app-08
  - list/node-list/a