Nuprl Lemma : make-lg_wf_dag
∀[T:Type]. ∀[L:T List]. (make-lg(L) ∈ LabeledDAG(T))
Proof
Definitions occuring in Statement :
ldag: LabeledDAG(T),
make-lg: make-lg(L),
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
ldag: LabeledDAG(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
prop: ℙ,
make-lg: make-lg(L),
is-dag: is-dag(g),
lg-edge: lg-edge(g;a;b),
lg-size: lg-size(g),
lg-in-edges: lg-in-edges(g;x),
top: Top,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
all: ∀x:A. B[x],
pi2: snd(t),
pi1: fst(t),
implies: P ⇒ Q,
int_seg: {i..j-},
not: ¬A,
false: False
Latex:
\mforall{}[T:Type]. \mforall{}[L:T List]. (make-lg(L) \mmember{} LabeledDAG(T))
Date html generated:
2016_05_17-AM-10_12_01
Last ObjectModification:
2015_12_29-PM-05_31_40
Theory : process-model
Home
Index