Nuprl Lemma : lg-add_wf_dag
∀[T:Type]. ∀[g:LabeledDAG(T)]. ∀[y:ℕlg-size(g)]. ∀[x:ℕy]. (lg-add(g;x;y) ∈ LabeledDAG(T))
Proof
Definitions occuring in Statement :
ldag: LabeledDAG(T),
lg-add: lg-add(g;a;b),
lg-size: lg-size(g),
int_seg: {i..j-},
uall: ∀[x:A]. B[x],
member: t ∈ T,
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
ldag: LabeledDAG(T),
int_seg: {i..j-},
lelt: i ≤ j < k,
and: P ∧ Q,
guard: {T},
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
squash: ↓T,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
prop: ℙ
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledDAG(T)]. \mforall{}[y:\mBbbN{}lg-size(g)]. \mforall{}[x:\mBbbN{}y]. (lg-add(g;x;y) \mmember{} LabeledDAG(T))
Date html generated:
2016_05_17-AM-10_11_59
Last ObjectModification:
2016_01_18-AM-00_21_44
Theory : process-model
Home
Index