Nuprl Lemma : normal-p-outcome
∀p:FinProbSpace. Normal(Outcome)
Proof
Definitions occuring in Statement :
normal-type: Normal(T),
all: ∀x:A. B[x],
p-outcome: Outcome,
finite-prob-space: FinProbSpace
Definitions unfolded in proof :
all: ∀x:A. B[x],
normal-type: Normal(T),
finite-prob-space: FinProbSpace,
p-outcome: Outcome,
member: t ∈ T,
and: P ∧ Q,
uall: ∀[x:A]. B[x],
or: P ∨ Q,
select: L[n],
uimplies: b supposing a,
nil: [],
it: ⋅,
so_lambda: λ2x y.t[x; y],
top: Top,
so_apply: x[s1;s2],
cons: [a / b],
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
nat_plus: ℕ+,
less_than: a < b,
squash: ↓T,
true: True,
guard: {T},
decidable: Dec(P),
uiff: uiff(P;Q),
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
sq_type: SQType(T),
so_lambda: λ2x.t[x],
so_apply: x[s],
iff: P ⇐⇒ Q
Latex:
\mforall{}p:FinProbSpace. Normal(Outcome)
Date html generated:
2016_05_16-AM-11_41_32
Last ObjectModification:
2016_01_17-PM-03_49_22
Theory : event-ordering
Home
Index