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

mon(λ n. rem(⌜nnf to n⌝ , np)), mon<(⌜nnf⌝ ) ⊦ mon<(lim(λ n. rem(⌜nnf to n⌝ , np))), mon<(rem(⌜nnf to n⌝ , np))

User applied rule insert proof lemma

And obtained the following new goals

Proof step 40:
mon<(⌜nl⌝ ) ⊦ mon<(rem(⌜nl⌝ , np))

Rule argument

path: 1, 1, 1, 1 subst: [nl, np] → [nnf to n, np]

Additional information

Used simplifier rules: monls-to: ⊦ mon<(⌜nnf⌝ ) → (mon<(⌜nnf to n⌝ ) ↔ true);