[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 less-add
⊦ x0 < a + x ↔ x0 = x ∨ x0 < x
Type: A proof obligation
Validity: The proof is valid.
Features: norw,
Comment: |- x0 < a + x <-> x0 = x or x0 < x
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 36
Used lemmas:
Used spec theorems:
array-listops
/
cons
array-listops
/
postfix
array
/
Extension
array-copy
/
at-copy
Used simplifier rules:
nat-basic
/
s-04
array
/
Size-put
array-copy
/
size-copy
nat
/
eq-01
array-copy
/
subarray-write-below
array
/
Size-mkarray
nat
/
lep-02
nat
/
le-def
nat-basic
/
refl-nat
nat-basic
/
a
nat-basic
/
c
array-copy
/
subarray-copy-elim-exact
array-copy
/
subarray-elim
nat
/
zero-02
nat-basic
/
z-01
nat
/
add-01
nat
/
lels
nat-basic
/
zero
nat-basic
/
nls-fst
nat
/
le
nat
/
le-add
array-copy
/
subarray-copy-higher
nat-basic
/
ls-02
nat
/
elim-sub
nat
/
le-ls-simp
nat-basic
/
eqs
nat
/
anti
array-copy
/
size-subarray
nat-basic
/
eq-02
nat
/
ler
nat-basic
/
l-01
nat-basic
/
f
nat-basic
/
lf-01
nat
/
lels-03
array-copy
/
subarray-at
nat-basic
/
succ
nat-basic
/
trans-nat
nat-basic
/
lf
nat-basic
/
l
nat-basic
/
l-06
nat-basic
/
add-base
nat-basic
/
one
nat
/
fle
nat
/
ls-le-simp