[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 le-ls-neq (conclusion)

⊦ dec ≤ dec0 ↔ dec < dec0 ∨ dec = dec0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 2:
⊦ dec_i ≤ dec_j ↔ ¬ dec_j < dec_i
Proof step 3:
⊦ ¬ dec0 < dec ↔ dec < dec0 ∨ dec = dec0

Rule argument

spec: inst: name: le-def seq: ⊦ dec_i ≤ dec_j ↔ ¬ dec_j < dec_i subst: [dec_j, dec_i] → [dec0, dec] flags: rewrite, current

Additional information

Used terms: dec0, dec