Nuprl Lemma : lg-contains_wf
∀[T:Type]. ∀[g1,g2:LabeledGraph(T)]. (g1 ⊆ g2 ∈ ℙ)
Proof
Definitions occuring in Statement :
lg-contains: g1 ⊆ g2,
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
universe: Type
Lemmas :
exists_wf,
equal_wf,
lg-append_wf,
labeled-graph_wf
Latex:
\mforall{}[T:Type]. \mforall{}[g1,g2:LabeledGraph(T)]. (g1 \msubseteq{} g2 \mmember{} \mBbbP{})
Date html generated:
2015_07_22-PM-00_28_01
Last ObjectModification:
2015_01_28-PM-11_32_23
Home
Index