Nuprl Lemma : finite-prob-space_wf
FinProbSpace ∈ Type
Proof
Definitions occuring in Statement :
finite-prob-space: FinProbSpace,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
finite-prob-space: FinProbSpace,
member: t ∈ T,
uall: ∀[x:A]. B[x],
and: P ∧ Q,
so_lambda: λ2x.t[x],
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,
prop: ℙ,
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_seg_wf,
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,
length_wf,
qsum_wf,
equal-wf-T-base,
rationals_wf,
list_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
setEquality,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
productEquality,
natural_numberEquality,
hypothesisEquality,
sqequalRule,
lambdaEquality,
because_Cache,
setElimination,
rename,
independent_isectElimination,
productElimination,
dependent_functionElimination,
unionElimination,
dependent_pairFormation,
int_eqEquality,
intEquality,
isect_memberEquality,
voidElimination,
voidEquality,
independent_pairFormation,
computeAll,
imageElimination,
baseClosed,
lambdaFormation,
applyEquality
Latex:
FinProbSpace \mmember{} Type
Date html generated:
2016_05_15-PM-11_44_40
Last ObjectModification:
2016_01_17-AM-10_07_45
Theory : randomness
Home
Index