[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 dom-max-in
⊦ st ≠ ∅ ∧ n > (dom st).max → (n ∈ st ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
apersistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 15
Used lemmas:
Used spec theorems:
oset
/nat-set/
max-ifins
store
/nat-store/
In-insert
Used simplifier rules:
nat
/
gr-def
store+set
/nat-store/
dom-ins
store
/nat-store/
neq
store+set
/nat-store/
dom-isemp
store+set
/nat-store/
dom-emp
store
/nat-store/
In-empty
nat-basic
/
succ
oelem
/nat-set/
transitivity
nat-basic
/
lf
nat-basic
/
f
nat-basic
/
a
nat-basic
/
c
nat-basic
/
l-05
nat
/
fle-01
nat
/
lels
store
/nat-store/
In-insert
nat-basic
/
lf-01
nat-basic
/
lf-02
nat-basic
/
ls-02