[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 56 from proof infinite-append-lem (previous step)

¬ ii(m) + n < ii(n0) + # lf(n0) ∨ ii(m) + n < ii(n0), (nf from ii(m)) to # lf(m) = lf(m), ii(m + 1) = ii(m) + # lf(m), ii(0) = 0, n < # lf(m), m < n0, ∀ m0. m0 ≤ m → ii(m0) ≤ ii(m), ∀ m. m < n0 → ii(m + 1) = ii(m) + # lf(m) ∧ (nf from ii(m)) to # lf(m) = lf(m) ∧ (∀ m0. m0 ≤ m → ii(m0) ≤ ii(m)) ⊦ nf(ii(m) + n) = lf(m)[n], n0 = 0, n0 = m, m = n0 + 1, lf(m) = []

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 57:
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
Proof step 58:
¬ ii(m) + n < ii(n0) + # lf(n0) ∨ ii(m) + n < ii(n0), #((nf from ii(m)) to # lf(m)) = # lf(m) ∧ (∀ n. n < #((nf from ii(m)) to # lf(m)) → ((nf from ii(m)) to # lf(m))[n] = lf(m)[n]), ii(m + 1) = ii(m) + # lf(m), ii(0) = 0, n < # lf(m), m < n0, ∀ m0. m0 ≤ m → ii(m0) ≤ ii(m), ∀ m. m < n0 → ii(m + 1) = ii(m) + # lf(m) ∧ (nf from ii(m)) to # lf(m) = lf(m) ∧ (∀ m0. m0 ≤ m → ii(m0) ≤ ii(m)) ⊦ nf(ii(m) + n) = lf(m)[n], n0 = 0, n0 = m, m = n0 + 1, lf(m) = []

Rule argument

spec: list-del inst: name: extension seq: ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) subst: [y, x] → [lf(m), (nf from ii(m)) to # lf(m)] flags: rewrite

Additional information

Used terms: lf(m), (nf from ii(m)) to # lf(m)