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
Definitions unfolded in proof :
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
so_lambda: λ2x y.t[x; y],
so_apply: x[s],
so_apply: x[s1;s2],
implies: P ⇒ Q,
so_lambda: λ2x.t[x],
strong-type-continuous: Continuous+(T.F[T]),
ext-eq: A ≡ B,
and: P ∧ Q,
subtype_rel: A ⊆r B,
prop: ℙ
Latex:
\mforall{}[F:Type {}\mrightarrow{} Type]. Continuous+(T.LabeledGraph(F[T])) supposing Continuous+(T.F[T])
Date html generated:
2016_05_17-AM-10_07_53
Last ObjectModification:
2015_12_29-PM-05_34_13
Theory : process-model
Home
Index