[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 4 from proof le-add-01 (
previous step
)
⊦ ¬ dec < mkDecimal(i - i0, j) ↔ mkDecimal(i - i0, j) ≤ dec
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 5
:
⊦ dec_i ≤ dec_j ↔ ¬ dec_j < dec_i
Rule argument
spec: inst: name: le-def seq: ⊦ dec_i ≤ dec_j ↔ ¬ dec_j < dec_i subst: [dec_j, dec_i] → [dec, mkDecimal(i - i0, j)] flags: rewrite, current
Additional information
Used terms: dec, mkDecimal(i - i0, j)