Nuprl Lemma : lg-map-wf_dag
∀[T,S:Type]. ∀[f:T ⟶ S]. ∀[g:LabeledDAG(T)]. (lg-map(f;g) ∈ LabeledDAG(S))
Proof
Definitions occuring in Statement :
lg-map: lg-map(f;g),
ldag: LabeledDAG(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
ldag: LabeledDAG(T),
uimplies: b supposing a,
prop: ℙ
Latex:
\mforall{}[T,S:Type]. \mforall{}[f:T {}\mrightarrow{} S]. \mforall{}[g:LabeledDAG(T)]. (lg-map(f;g) \mmember{} LabeledDAG(S))
Date html generated:
2016_05_17-AM-10_12_38
Last ObjectModification:
2015_12_29-PM-05_31_15
Theory : process-model
Home
Index