Nuprl Lemma : lg-add_wf
∀[T:Type]. ∀[g:LabeledGraph(T)]. ∀[a,b:ℕlg-size(g)]. (lg-add(g;a;b) ∈ LabeledGraph(T))
Proof
Definitions occuring in Statement :
lg-add: lg-add(g;a;b),
lg-size: lg-size(g),
labeled-graph: LabeledGraph(T),
int_seg: {i..j-},
uall: ∀[x:A]. B[x],
member: t ∈ T,
natural_number: $n,
universe: Type
Lemmas :
list_wf,
top_wf,
length_wf,
mklist_wf,
length_wf_nat,
int_seg_wf,
mklist_length,
select_wf,
sq_stable__le,
eq_int_wf,
bool_wf,
eqtt_to_assert,
assert_of_eq_int,
cons_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_int,
lelt_wf,
lg-size_wf,
nat_wf,
labeled-graph_wf
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. \mforall{}[a,b:\mBbbN{}lg-size(g)]. (lg-add(g;a;b) \mmember{} LabeledGraph(T))
Date html generated:
2015_07_22-PM-00_28_38
Last ObjectModification:
2015_01_28-PM-11_33_02
Home
Index