{ 
[A,B:Type]. LabeledGraph(A) 
r LabeledGraph(B) supposing A r B }
{ Proof }
Definitions occuring in Statement :
labeled-graph: LabeledGraph(T),
subtype_rel: A r B,
uimplies: b supposing a,
uall: [x:A]. B[x],
universe: Type
Definitions :
uall: [x:A]. B[x],
uimplies: b supposing a,
type-monotone: Monotone(T.F[T]),
so_lambda: 
x.t[x],
member: t 
T,
so_apply: x[s],
guard: {T}
Lemmas :
monotone-labeled-graph
\mforall{}[A,B:Type]. LabeledGraph(A) \msubseteq{}r LabeledGraph(B) supposing A \msubseteq{}r B
Date html generated:
2011_08_16-PM-06_35_49
Last ObjectModification:
2011_06_20-AM-01_55_10
Home
Index