Nuprl Lemma : one_or_both_ind_oobboth_lemma
∀right,left,both,bval:Top.
(one_or_both_ind(oobboth(bval);bval.both[bval];lval.left[lval];rval.right[rval]) ~ both[bval])
Proof
Definitions occuring in Statement :
one_or_both_ind: one_or_both_ind(x;bval.both[bval];lval.left[lval];rval.right[rval]),
oobboth: oobboth(bval),
top: Top,
so_apply: x[s],
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
oobboth: oobboth(bval),
one_or_both_ind: one_or_both_ind(x;bval.both[bval];lval.left[lval];rval.right[rval])
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}right,left,both,bval:Top.
(one\_or\_both\_ind(oobboth(bval);bval.both[bval];lval.left[lval];rval.right[rval]) \msim{} both[bval])
Date html generated:
2016_05_15-PM-05_32_55
Last ObjectModification:
2015_12_27-PM-02_09_27
Theory : general
Home
Index