Nuprl Lemma : lg-append-contains
∀[T:Type]. ∀g1,g2:LabeledGraph(T). (g1 ⊆ lg-append(g1;g2) ∧ g2 ⊆ lg-append(g1;g2))
Proof
Definitions occuring in Statement :
lg-contains: g1 ⊆ g2,
lg-append: lg-append(g1;g2),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
and: P ∧ Q,
universe: Type
Lemmas :
labeled-graph_wf,
lg-nil_wf,
lg-append_assoc,
lg-nil-append,
lg-append_wf,
equal_wf,
exists_wf,
squash_wf,
true_wf,
lg-append-nil,
iff_weakening_equal
Latex:
\mforall{}[T:Type]. \mforall{}g1,g2:LabeledGraph(T). (g1 \msubseteq{} lg-append(g1;g2) \mwedge{} g2 \msubseteq{} lg-append(g1;g2))
Date html generated:
2015_07_22-PM-00_28_03
Last ObjectModification:
2015_02_04-PM-04_03_33
Home
Index