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

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

User applied rule insert spec-lemma

And obtained the following new goals

Proof step 36:
⊦ mon(λ n. rem(⌜nnf to n⌝ , np))
Proof step 37:
mon(λ n. rem(⌜nnf to n⌝ , np)), mon<(⌜nnf⌝ ) ⊦ mon<(lim(λ n. rem(⌜nnf to n⌝ , np))), mon<(rem(⌜nnf to n⌝ , np)) ∧ mon(λ n. rem(⌜nnf to n⌝ , np))

Rule argument

spec: mon-lim-filter-count inst: natstream name: mon-remfun seq: ⊦ mon(λ n. rem(⌜nnf to n⌝ , np)) subst: [nnf, np] → [nnf, np] flags: []

Additional information

Used terms: nnf, np