Nuprl Lemma : monotone-ldag
∀[F:Type ⟶ Type]. Monotone(T.LabeledDAG(F[T])) supposing Monotone(T.F[T])
Proof
Definitions occuring in Statement :
ldag: LabeledDAG(T),
type-monotone: Monotone(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,
type-monotone: Monotone(T.F[T]),
ldag: LabeledDAG(T),
so_apply: x[s],
so_lambda: λ2x.t[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
prop: ℙ,
subtype_rel: A ⊆r B
Latex:
\mforall{}[F:Type {}\mrightarrow{} Type]. Monotone(T.LabeledDAG(F[T])) supposing Monotone(T.F[T])
Date html generated:
2016_05_17-AM-10_11_45
Last ObjectModification:
2015_12_29-PM-05_31_58
Theory : process-model
Home
Index