Nuprl Lemma : Game_ext

Game ≡ LR:GameA{i:l}() × (GameB(LR) ⟶ Game)


Proof




Definitions occuring in Statement :  Game: Game GameB: GameB(p) GameA: GameA{i:l}() ext-eq: A ≡ B function: x:A ⟶ B[x] product: x:A × B[x]
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T so_lambda: λ2x.t[x] so_apply: x[s] Game: Game
Lemmas referenced :  W-ext GameA_wf GameB_wf
Rules used in proof :  cut instantiate introduction extract_by_obid sqequalHypSubstitution sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isectElimination thin hypothesis sqequalRule lambdaEquality cumulativity hypothesisEquality

Latex:
Game  \mequiv{}  LR:GameA\{i:l\}()  \mtimes{}  (GameB(LR)  {}\mrightarrow{}  Game)



Date html generated: 2018_05_22-PM-09_52_17
Last ObjectModification: 2018_05_20-PM-10_36_22

Theory : Numbers!and!Games


Home Index