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
Lemmas :
monotone-labeled-graph,
subtype_rel_wf
Latex:
\mforall{}[A,B:Type]. LabeledGraph(A) \msubseteq{}r LabeledGraph(B) supposing A \msubseteq{}r B
Date html generated:
2015_07_22-PM-00_27_37
Last ObjectModification:
2015_01_28-PM-11_32_29
Home
Index