Nuprl Lemma : GameB_wf
∀[p:GameA{i:l}()]. (GameB(p) ∈ Type)
Proof
Definitions occuring in Statement :
GameB: GameB(p),
GameA: GameA{i:l}(),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
GameB: GameB(p),
GameA: GameA{i:l}()
Lemmas referenced :
GameA_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
spreadEquality,
sqequalHypSubstitution,
productElimination,
thin,
independent_pairEquality,
hypothesisEquality,
unionEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
extract_by_obid
Latex:
\mforall{}[p:GameA\{i:l\}()]. (GameB(p) \mmember{} Type)
Date html generated:
2018_05_22-PM-09_52_13
Last ObjectModification:
2018_05_20-PM-10_36_16
Theory : Numbers!and!Games
Home
Index