Nuprl Lemma : p-outcome_wf

[p:FinProbSpace]. (Outcome ∈ Type)


Proof




Definitions occuring in Statement :  p-outcome: Outcome finite-prob-space: FinProbSpace uall: [x:A]. B[x] member: t ∈ T universe: Type
Definitions unfolded in proof :  p-outcome: Outcome finite-prob-space: FinProbSpace uall: [x:A]. B[x] member: t ∈ T prop: so_lambda: λ2x.t[x] and: P ∧ Q int_seg: {i..j-} uimplies: 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:  Q not: ¬A top: Top less_than: a < b squash: T so_apply: x[s] subtype_rel: A ⊆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 rationals_wf length_wf int_seg_wf
Rules used in proof :  sqequalSubstitution sqequalRule sqequalReflexivity sqequalTransitivity computationStep isect_memberFormation introduction cut lemma_by_obid sqequalHypSubstitution isectElimination thin natural_numberEquality hypothesis setElimination rename hypothesisEquality axiomEquality equalityTransitivity equalitySymmetry lambdaEquality productEquality because_Cache independent_isectElimination productElimination dependent_functionElimination unionElimination dependent_pairFormation int_eqEquality intEquality isect_memberEquality voidElimination voidEquality independent_pairFormation computeAll imageElimination baseClosed lambdaFormation applyEquality setEquality

Latex:
\mforall{}[p:FinProbSpace].  (Outcome  \mmember{}  Type)



Date html generated: 2016_05_15-PM-11_45_00
Last ObjectModification: 2016_01_17-AM-10_07_31

Theory : randomness


Home Index