Nuprl Lemma : rv-sample_wf
∀[k:FinProbSpace]. ∀[n:ℕ]. ∀[i:ℕn]. ∀[X:Outcome ⟶ ℚ]. (X@i ∈ RandomVariable(k;n))
Proof
Definitions occuring in Statement :
rv-sample: X@i,
random-variable: RandomVariable(p;n),
p-outcome: Outcome,
finite-prob-space: FinProbSpace,
rationals: ℚ,
int_seg: {i..j-},
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
natural_number: $n
Definitions unfolded in proof :
rv-sample: X@i,
random-variable: RandomVariable(p;n),
p-outcome: Outcome,
finite-prob-space: FinProbSpace,
uall: ∀[x:A]. B[x],
member: t ∈ T,
nat: ℕ,
prop: ℙ,
so_lambda: λ2x.t[x],
and: P ∧ Q,
int_seg: {i..j-},
uimplies: b supposing a,
guard: {T},
lelt: i ≤ j < k,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
less_than: a < b,
squash: ↓T,
so_apply: x[s],
subtype_rel: A ⊆r B
Lemmas referenced :
int-subtype-rationals,
qle_wf,
l_member_wf,
l_all_wf2,
int_formula_prop_less_lemma,
intformless_wf,
decidable__lt,
int_formula_prop_wf,
int_term_value_var_lemma,
int_term_value_constant_lemma,
int_formula_prop_le_lemma,
int_formula_prop_not_lemma,
int_formula_prop_and_lemma,
itermVar_wf,
itermConstant_wf,
intformle_wf,
intformnot_wf,
intformand_wf,
satisfiable-full-omega-tt,
decidable__le,
int_seg_properties,
select_wf,
qsum_wf,
equal-wf-T-base,
list_wf,
set_wf,
nat_wf,
rationals_wf,
length_wf,
int_seg_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
lambdaEquality,
applyEquality,
hypothesisEquality,
functionEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
natural_numberEquality,
setElimination,
rename,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache,
productEquality,
independent_isectElimination,
productElimination,
dependent_functionElimination,
unionElimination,
dependent_pairFormation,
int_eqEquality,
intEquality,
voidElimination,
voidEquality,
independent_pairFormation,
computeAll,
imageElimination,
baseClosed,
lambdaFormation,
setEquality
Latex:
\mforall{}[k:FinProbSpace]. \mforall{}[n:\mBbbN{}]. \mforall{}[i:\mBbbN{}n]. \mforall{}[X:Outcome {}\mrightarrow{} \mBbbQ{}]. (X@i \mmember{} RandomVariable(k;n))
Date html generated:
2016_05_15-PM-11_46_24
Last ObjectModification:
2016_01_17-AM-10_07_00
Theory : randomness
Home
Index