Nuprl Lemma : continuous-labeled-graph
∀[F:Type ─→ Type]. Continuous+(T.LabeledGraph(F[T])) supposing Continuous+(T.F[T])
Proof
Definitions occuring in Statement :
labeled-graph: LabeledGraph(T),
strong-type-continuous: Continuous+(T.F[T]),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ─→ B[x],
universe: Type
Lemmas :
strong-continuous-dep-isect,
list_wf,
top_wf,
int_seg_wf,
length_wf,
strong-continuous-list,
strong-continuous-product,
continuous-constant,
nat_wf,
strong-type-continuous_wf
Latex:
\mforall{}[F:Type {}\mrightarrow{} Type]. Continuous+(T.LabeledGraph(F[T])) supposing Continuous+(T.F[T])
Date html generated:
2015_07_22-PM-00_27_34
Last ObjectModification:
2015_01_28-PM-11_32_28
Home
Index