Nuprl Lemma : lg-nil-append
∀[T:Type]. ∀[g:LabeledGraph(T)]. (lg-append(lg-nil();g) ~ g)
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,
sqequal: s ~ t
Definitions unfolded in proof :
lg-nil: lg-nil(),
lg-append: lg-append(g1;g2),
append: as @ bs,
all: ∀x:A. B[x],
so_lambda: so_lambda(x,y,z.t[x; y; z]),
member: t ∈ T,
top: Top,
so_apply: x[s1;s2;s3],
lg-size: lg-size(g),
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
labeled-graph: LabeledGraph(T),
subtype_rel: A ⊆r B,
nat: ℕ,
uimplies: b supposing a,
so_lambda: λ2x.t[x],
so_apply: x[s],
int_seg: {i..j-},
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],
guard: {T},
decidable: Dec(P),
nil: [],
it: ⋅,
sq_type: SQType(T),
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
spreadn: spread3
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. (lg-append(lg-nil();g) \msim{} g)
Date html generated:
2016_05_17-AM-10_08_17
Last ObjectModification:
2016_01_18-AM-00_23_15
Theory : process-model
Home
Index