Nuprl Lemma : one_or_both_oobleft_lemma
∀right,left,both,lval:Top.
  (one_or_both_ind(oobleft(lval);bval.both[bval];lval.left[lval];rval.right[rval]) ~ left[lval])
Proof
Definitions occuring in Statement : 
one_or_both_ind: one_or_both_ind(x;bval.both[bval];lval.left[lval];rval.right[rval])
, 
oobleft: oobleft(lval)
, 
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
, 
oobleft: oobleft(lval)
, 
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,lval:Top.
    (one\_or\_both\_ind(oobleft(lval);bval.both[bval];lval.left[lval];rval.right[rval])  \msim{}  left[lval])
Date html generated:
2016_05_15-PM-05_33_05
Last ObjectModification:
2015_12_27-PM-02_09_16
Theory : general
Home
Index