Nuprl Lemma : continuous-ldag
∀[F:Type ⟶ Type]. Continuous+(T.LabeledDAG(F[T])) supposing Continuous+(T.F[T])
Proof
Definitions occuring in Statement :
ldag: LabeledDAG(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 :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
ldag: LabeledDAG(T),
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
top: Top,
strong-type-continuous: Continuous+(T.F[T]),
ext-eq: A ≡ B,
and: P ∧ Q,
prop: ℙ
Latex:
\mforall{}[F:Type {}\mrightarrow{} Type]. Continuous+(T.LabeledDAG(F[T])) supposing Continuous+(T.F[T])
Date html generated:
2016_05_17-AM-10_11_42
Last ObjectModification:
2015_12_29-PM-05_32_01
Theory : process-model
Home
Index