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