Step
*
2
1
of Lemma
list-at_wf
1. T : Type
2. n : ℤ
3. 0 < n
4. ∀ns:colist(ℕ). ∀L:colist(T). (L@ns ∈ primrec(n - 1;Top;λ,L. (Unit ⋃ (T × L))))
5. ns : colist(ℕ)
6. L : colist(T)
⊢ L@ns ∈ Unit ⋃ (T × primrec(n - 1;Top;λ,L. (Unit ⋃ (T × L))))
BY
{ colistD (-2) }
1
1. T : Type
2. n : ℤ
3. 0 < n
4. ∀ns:colist(ℕ). ∀L:colist(T). (L@ns ∈ primrec(n - 1;Top;λ,L. (Unit ⋃ (T × L))))
5. L : colist(T)
⊢ L@[] ∈ Unit ⋃ (T × primrec(n - 1;Top;λ,L. (Unit ⋃ (T × L))))
2
1. T : Type
2. n : ℤ
3. 0 < n
4. ∀ns:colist(ℕ). ∀L:colist(T). (L@ns ∈ primrec(n - 1;Top;λ,L. (Unit ⋃ (T × L))))
5. u : ℕ
6. v : colist(ℕ)
7. L : colist(T)
⊢ L@[u / v] ∈ Unit ⋃ (T × primrec(n - 1;Top;λ,L. (Unit ⋃ (T × L))))
Latex:
Latex:
1. T : Type
2. n : \mBbbZ{}
3. 0 < n
4. \mforall{}ns:colist(\mBbbN{}). \mforall{}L:colist(T). (L@ns \mmember{} primrec(n - 1;Top;\mlambda{},L. (Unit \mcup{} (T \mtimes{} L))))
5. ns : colist(\mBbbN{})
6. L : colist(T)
\mvdash{} L@ns \mmember{} Unit \mcup{} (T \mtimes{} primrec(n - 1;Top;\mlambda{},L. (Unit \mcup{} (T \mtimes{} L))))
By
Latex:
colistD (-2)
Home
Index