Nuprl Lemma : right-option_wf
∀[m,g:Game]. (right-option{i:l}(g;m) ∈ ℙ')
Proof
Definitions occuring in Statement :
right-option: right-option{i:l}(g;m),
Game: Game,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
right-option: right-option{i:l}(g;m),
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
exists_wf,
right-indices_wf,
equal_wf,
Game_wf,
right-move_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
thin,
instantiate,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
cumulativity,
hypothesisEquality,
hypothesis,
lambdaEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[m,g:Game]. (right-option\{i:l\}(g;m) \mmember{} \mBbbP{}')
Date html generated:
2018_05_22-PM-09_52_38
Last ObjectModification:
2018_05_20-PM-10_36_57
Theory : Numbers!and!Games
Home
Index