Nuprl Lemma : win2strat_wf
∀[g:SimpleGame]. ∀[n:ℕ]. (win2strat(g;n) ∈ Type)
Proof
Definitions occuring in Statement :
win2strat: win2strat(g;n),
simple-game: SimpleGame,
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
and: P ∧ Q
Lemmas referenced :
win2strat-strat2play-wf,
nat_wf,
simple-game_wf
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
hypothesis,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
productElimination,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[g:SimpleGame]. \mforall{}[n:\mBbbN{}]. (win2strat(g;n) \mmember{} Type)
Date html generated:
2018_07_25-PM-01_32_03
Last ObjectModification:
2018_06_11-PM-05_47_37
Theory : co-recursion
Home
Index