Nuprl Lemma : is-dag_wf
∀[T:Type]. ∀[g:LabeledGraph(T)]. (is-dag(g) ∈ ℙ)
Proof
Definitions occuring in Statement :
is-dag: is-dag(g),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
is-dag: is-dag(g),
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
int_seg: {i..j-},
so_apply: x[s]
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. (is-dag(g) \mmember{} \mBbbP{})
Date html generated:
2016_05_17-AM-10_11_19
Last ObjectModification:
2015_12_29-PM-05_32_06
Theory : process-model
Home
Index