[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 12 from proof append-cancel-l (previous step)
| (λ n. (n < # x ⊃ x[n];nf(n - # x))) = (λ n. (n < # x ⊃ x[n];nf0(n - # x))) ⊦ nf(n) = nf0(n) |
User applied rule expand left
And closed the goal!
Rule argument
pos: left 1 terms: n + # x abort: F discard: F computed: FAdditional information
Used simplifier rules:
l-02: ⊦ ¬ m + n < m; from specification nat-basic2%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic2%c: ⊦ m + n = n + m; from specification nat-basic2%eq-01: ⊦ m + n - m = n; from specification nat
Used terms: n + # x