Step
*
1
1
of Lemma
strong-continuous-list
.....assertion.....
1. F : Type ⟶ Type
2. Continuous+(T.F T)
3. X : ℕ ⟶ Type
4. x : ⋂n:ℕ. ((F (X n)) List)
⊢ ∀i:ℕ||x||. (x[i] ∈ F (⋂n:ℕ. (X n)))
BY
{ D 0 }
1
1. F : Type ⟶ Type
2. Continuous+(T.F T)
3. X : ℕ ⟶ Type
4. x : ⋂n:ℕ. ((F (X n)) List)
5. i : ℕ||x||
⊢ x[i] ∈ F (⋂n:ℕ. (X n))
2
.....wf.....
1. F : Type ⟶ Type
2. Continuous+(T.F T)
3. X : ℕ ⟶ Type
4. x : ⋂n:ℕ. ((F (X n)) List)
⊢ ℕ||x|| ∈ Type
Latex:
Latex:
.....assertion.....
1. F : Type {}\mrightarrow{} Type
2. Continuous+(T.F T)
3. X : \mBbbN{} {}\mrightarrow{} Type
4. x : \mcap{}n:\mBbbN{}. ((F (X n)) List)
\mvdash{} \mforall{}i:\mBbbN{}||x||. (x[i] \mmember{} F (\mcap{}n:\mBbbN{}. (X n)))
By
Latex:
D 0
Home
Index