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
Lemmas :
subtype_rel_wf,
type-monotone_wf,
list_wf,
top_wf,
int_seg_wf,
length_wf,
subtype_rel_self,
dep-isect-subtype2,
subtype_rel_list,
subtype_rel_product
Latex:
\mforall{}[F:Type {}\mrightarrow{} Type]. Monotone(T.LabeledGraph(F[T])) supposing Monotone(T.F[T])
Date html generated:
2015_07_22-PM-00_27_35
Last ObjectModification:
2015_01_28-PM-11_33_12
Home
Index