Nuprl Lemma : weighted-sum-nil
∀[F:Top]. (weighted-sum([];F) ~ 0)
Proof
Definitions occuring in Statement :
weighted-sum: weighted-sum(p;F),
nil: [],
uall: ∀[x:A]. B[x],
top: Top,
natural_number: $n,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
uall: ∀[x:A]. B[x]
Lemmas referenced :
ws_nil_lemma,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
cut,
lemma_by_obid,
sqequalHypSubstitution,
sqequalTransitivity,
computationStep,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
isect_memberFormation,
introduction,
sqequalAxiom
Latex:
\mforall{}[F:Top]. (weighted-sum([];F) \msim{} 0)
Date html generated:
2016_05_15-PM-11_45_14
Last ObjectModification:
2015_12_28-PM-07_16_40
Theory : randomness
Home
Index