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
Lemmas :
lg-size_wf,
subtype_rel_list,
list_wf,
int_seg_wf,
nat_wf,
subtype_rel_product,
nat_properties,
less_than_transitivity1,
less_than_irreflexivity,
ge_wf,
less_than_wf,
equal-wf-T-base,
colength_wf_list,
list-cases,
map_nil_lemma,
product_subtype_list,
spread_cons_lemma,
sq_stable__le,
le_antisymmetry_iff,
add_functionality_wrt_le,
add-associates,
add-zero,
zero-add,
le-add-cancel,
decidable__le,
false_wf,
not-le-2,
condition-implies-le,
minus-add,
minus-one-mul,
add-commutes,
le_wf,
subtract_wf,
not-ge-2,
less-iff-le,
minus-minus,
add-swap,
subtype_base_sq,
set_subtype_base,
int_subtype_base,
map_cons_lemma,
equal-wf-base,
list_subtype_base
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. (lg-append(lg-nil();g) \msim{} g)
Date html generated:
2015_07_22-PM-00_27_58
Last ObjectModification:
2015_01_28-PM-11_33_15
Home
Index