[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 2 from proof monls-from (previous step)

mon<(⌜nnf⌝ ) ⊦ mon<(⌜nnf from n⌝ )

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 3:
⊦ mon<(nσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # nσ → nσ[n] < nσ[n + 1])
Proof step 4:
mon<(⌜nnf⌝ ) ⊦ ∀ n0. ⌜n0⌝ + ⌜1⌝ < # ⌜nnf from n⌝ → ⌜nnf from n⌝ [n0] < ⌜nnf from n⌝ [n0 + 1]

Rule argument

spec: inst: name: monls-def seq: ⊦ mon<(nσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # nσ → nσ[n] < nσ[n + 1]) subst: [nσ] → [⌜nnf from n⌝ ] flags: rewrite, current

Additional information

Used terms: ⌜nnf from n⌝