Nuprl Lemma : lg-nil_wf_dag
∀[T:Type]. (lg-nil() ∈ LabeledDAG(T))
Proof
Definitions occuring in Statement :
ldag: LabeledDAG(T),
lg-nil: lg-nil(),
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),
prop: ℙ,
lg-nil: lg-nil(),
is-dag: is-dag(g),
lg-size: lg-size(g),
all: ∀x:A. B[x],
implies: P ⇒ Q,
guard: {T},
int_seg: {i..j-},
lelt: i ≤ j < k,
and: P ∧ Q,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
top: Top
Latex:
\mforall{}[T:Type]. (lg-nil() \mmember{} LabeledDAG(T))
Date html generated:
2016_05_17-AM-10_18_07
Last ObjectModification:
2016_01_18-AM-00_21_14
Theory : process-model
Home
Index