Nuprl Lemma : lg-append_wf
∀[T:Type]. ∀[g1,g2:LabeledGraph(T)]. (lg-append(g1;g2) ∈ LabeledGraph(T))
Proof
Definitions occuring in Statement :
lg-append: lg-append(g1;g2),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
lg-append: lg-append(g1;g2),
labeled-graph: LabeledGraph(T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
guard: {T},
uimplies: b supposing a,
so_lambda: λ2x.t[x],
so_apply: x[s],
int_seg: {i..j-},
spreadn: spread3,
nat: ℕ,
top: Top,
and: P ∧ Q,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
prop: ℙ,
ge: i ≥ j ,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
lg-size: lg-size(g),
uiff: uiff(P;Q),
lelt: i ≤ j < k
Latex:
\mforall{}[T:Type]. \mforall{}[g1,g2:LabeledGraph(T)]. (lg-append(g1;g2) \mmember{} LabeledGraph(T))
Date html generated:
2016_05_17-AM-10_08_04
Last ObjectModification:
2016_01_18-AM-00_23_44
Theory : process-model
Home
Index