[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 max-com
⊦ x + x0 ≠ [] → (max(x + x0) = max(x0 + x) ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: as, las,
Comment:
Used by:
max-com-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 26
Used lemmas:
max-base
,
max-rec
,
Used spec theorems:
Used simplifier rules:
list
/
Nil
list
/
app
list
/
a
list
/
c
list
/
e-01
list
/
app-02
list
/
e-03
list
/
len-05
nat-basic
/
succ
nat-basic
/
l
nat-basic
/
a
nat-basic
/
c
weakord
/tord/
ls-le
tord
/
seq
nat
/
lels
nat
/
le-add
weakord
/tord/
leq-trans
weakord
/tord/
nen
weakord
/tord/
transitivity
weakord
/tord/
lel
weakord
/tord/
irreflexivity
weakord
/tord/
nll
tord
/
sls