Nuprl Lemma : decidable__p-outcome
∀p:FinProbSpace. Dec(Outcome)
Proof
Definitions occuring in Statement :
p-outcome: Outcome,
finite-prob-space: FinProbSpace,
decidable: Dec(P),
all: ∀x:A. B[x]
Definitions unfolded in proof :
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
member: t ∈ T,
prop: ℙ,
uall: ∀[x:A]. B[x]
Lemmas referenced :
not_wf,
p-outcome_wf,
finite-prob-space_wf,
natural_number_wf_p-outcome
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
inlFormation,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
introduction
Latex:
\mforall{}p:FinProbSpace. Dec(Outcome)
Date html generated:
2016_05_15-PM-11_45_04
Last ObjectModification:
2015_12_28-PM-07_16_50
Theory : randomness
Home
Index