Nuprl Lemma : left_indices_add_lemma
∀H,G:Top. (left-indices(G ⊕ H) ~ left-indices(G) + left-indices(H))
Proof
Definitions occuring in Statement :
Game-add: G ⊕ H,
left-indices: left-indices(g),
top: Top,
all: ∀x:A. B[x],
union: left + right,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
left-indices: left-indices(g),
pi1: fst(t),
Game-add: G ⊕ H,
mkGame: {mkGame(f[a] with a:L | g[b] with b:R},
Wsup: Wsup(a;b),
member: t ∈ T
Lemmas referenced :
istype-top
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation_alt,
cut,
sqequalRule,
hypothesis,
inhabitedIsType,
hypothesisEquality,
introduction,
extract_by_obid
Latex:
\mforall{}H,G:Top. (left-indices(G \moplus{} H) \msim{} left-indices(G) + left-indices(H))
Date html generated:
2019_10_31-AM-06_35_05
Last ObjectModification:
2019_09_12-PM-01_40_31
Theory : Numbers!and!Games
Home
Index