---

Step * of Lemma replace-seq-from-member-enum

∀f:ℕ ⟶ 𝔹. ∀m:ℕ.  (replace-seq-from(f;m;tt) ∈ enum-fin-seq(m))
BY
{ InductionOnNat }

1
.....basecase..... 
1. f : ℕ ⟶ 𝔹@i
⊢ (replace-seq-from(f;0;tt) ∈ enum-fin-seq(0))

2
.....upcase..... 
1. f : ℕ ⟶ 𝔹@i
2. m : ℤ@i
3. [%1] : 0 < m@i
4. (replace-seq-from(f;m - 1;tt) ∈ enum-fin-seq(m - 1))
⊢ (replace-seq-from(f;m;tt) ∈ enum-fin-seq(m))

---

Latex:

---

Latex:
\mforall{}f:\mBbbN{}  {}\mrightarrow{}  \mBbbB{}.  \mforall{}m:\mBbbN{}.    (replace-seq-from(f;m;tt)  \mmember{}  enum-fin-seq(m))


By

---

Latex:
InductionOnNat

---

Home Index