Nuprl Lemma : rv-le_wf

[p:FinProbSpace]. ∀[n:ℕ]. ∀[X,Y:RandomVariable(p;n)].  (X ≤ Y ∈ ℙ)


Proof




Definitions occuring in Statement :  rv-le: X ≤ Y random-variable: RandomVariable(p;n) finite-prob-space: FinProbSpace nat: uall: [x:A]. B[x] prop: member: t ∈ T
Definitions unfolded in proof :  rv-le: X ≤ Y random-variable: RandomVariable(p;n) uall: [x:A]. B[x] member: t ∈ T nat: so_lambda: λ2x.t[x] p-outcome: Outcome so_apply: x[s] finite-prob-space: FinProbSpace
Lemmas referenced :  all_wf int_seg_wf p-outcome_wf qle_wf length_wf rationals_wf nat_wf finite-prob-space_wf
Rules used in proof :  sqequalSubstitution sqequalRule sqequalReflexivity sqequalTransitivity computationStep isect_memberFormation introduction cut lemma_by_obid sqequalHypSubstitution isectElimination thin functionEquality natural_numberEquality setElimination rename hypothesisEquality hypothesis lambdaEquality applyEquality axiomEquality equalityTransitivity equalitySymmetry isect_memberEquality because_Cache

Latex:
\mforall{}[p:FinProbSpace].  \mforall{}[n:\mBbbN{}].  \mforall{}[X,Y:RandomVariable(p;n)].    (X  \mleq{}  Y  \mmember{}  \mBbbP{})



Date html generated: 2016_05_15-PM-11_48_17
Last ObjectModification: 2015_12_28-PM-07_15_01

Theory : randomness


Home Index