Nuprl Lemma : lg-append-nil
∀[T:Type]. ∀[g:LabeledGraph(T)]. (lg-append(g;lg-nil()) = g ∈ LabeledGraph(T))
Proof
Definitions occuring in Statement :
lg-append: lg-append(g1;g2),
lg-nil: lg-nil(),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
lg-nil: lg-nil(),
lg-append: lg-append(g1;g2),
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
labeled-graph: LabeledGraph(T),
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. (lg-append(g;lg-nil()) = g)
Date html generated:
2016_05_17-AM-10_08_13
Last ObjectModification:
2015_12_29-PM-05_34_01
Theory : process-model
Home
Index