Nuprl Lemma : subtype_rel-labeled-graph
∀[A,B:Type]. LabeledGraph(A) ⊆r LabeledGraph(B) supposing A ⊆r B
Proof
Definitions occuring in Statement :
labeled-graph: LabeledGraph(T),
uimplies: b supposing a,
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
member: t ∈ T,
so_apply: x[s],
uimplies: b supposing a,
type-monotone: Monotone(T.F[T]),
subtype_rel: A ⊆r B
Latex:
\mforall{}[A,B:Type]. LabeledGraph(A) \msubseteq{}r LabeledGraph(B) supposing A \msubseteq{}r B
Date html generated:
2016_05_17-AM-10_07_57
Last ObjectModification:
2015_12_29-PM-05_34_12
Theory : process-model
Home
Index