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