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
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
and: P ∧ Q,
cand: A c∧ B,
lg-contains: g1 ⊆ g2,
member: t ∈ T,
exists: ∃x:A. B[x],
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
squash: ↓T,
true: True,
uimplies: b supposing a,
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q
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:
2016_05_17-AM-10_08_25
Last ObjectModification:
2016_01_18-AM-00_23_06
Theory : process-model
Home
Index