[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
,
Proof step 1 from proof lextrans (conclusion)
⊦ lex<(a, b, a0, b0) ∧ lex<(a0, b0, a1, b1) → lex<(a, b, a1, b1)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
lex<(a, b, a0, b0), lex<(a0, b0, a1, b1) ⊦ lex<(a, b, a1, b1)
Rule argument
Additional information