Nuprl Lemma : lg-append_assoc
∀[T:Type]. ∀[a,b,c:LabeledGraph(T)]. (lg-append(a;lg-append(b;c)) ~ lg-append(lg-append(a;b);c))
Proof
Definitions occuring in Statement :
lg-append: lg-append(g1;g2),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
lg-append: lg-append(g1;g2),
top: Top,
member: t ∈ T,
compose: f o g,
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
guard: {T},
nat: ℕ,
uimplies: b supposing a,
int_seg: {i..j-},
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
and: P ∧ Q,
prop: ℙ,
or: P ∨ Q,
cons: [a / b],
colength: colength(L),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
decidable: Dec(P),
nil: [],
it: ⋅,
sq_type: SQType(T),
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
spreadn: spread3,
lg-size: lg-size(g)
Latex:
\mforall{}[T:Type]. \mforall{}[a,b,c:LabeledGraph(T)]. (lg-append(a;lg-append(b;c)) \msim{} lg-append(lg-append(a;b);c))
Date html generated:
2016_05_17-AM-10_08_09
Last ObjectModification:
2016_01_18-AM-00_23_39
Theory : process-model
Home
Index