Nuprl Lemma : bm_foldli_wf
∀[T,U,Key:Type]. ∀[f:Key ⟶ T ⟶ U ⟶ U]. ∀[m:binary-map(T;Key)]. ∀[init:U]. (bm_foldli(f;init;m) ∈ U)
Proof
Definitions occuring in Statement :
bm_foldli: bm_foldli(f;init;m),
binary-map: binary-map(T;Key),
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,
bm_foldli: bm_foldli(f;init;m)
Latex:
\mforall{}[T,U,Key:Type]. \mforall{}[f:Key {}\mrightarrow{} T {}\mrightarrow{} U {}\mrightarrow{} U]. \mforall{}[m:binary-map(T;Key)]. \mforall{}[init:U].
(bm\_foldli(f;init;m) \mmember{} U)
Date html generated:
2016_05_17-PM-01_43_34
Last ObjectModification:
2015_12_28-PM-08_08_22
Theory : binary-map
Home
Index