Nuprl Lemma : isinr-implies

[t:Base]. (t inr outr(t) supposing ((↑isinr(t)) and (t)↓)


Definitions occuring in Statement :  has-value: (a)↓ outr: outr(x) assert: b bfalse: ff btrue: tt uimplies: supposing a uall: [x:A]. B[x] isinr: isinr def inr: inr  base: Base sqequal: t
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a has-value: (a)↓ outr: outr(x) assert: b ifthenelse: if then else fi  btrue: tt implies:  Q prop: bfalse: ff false: False top: Top
Lemmas referenced :  base_wf bfalse_wf top_wf btrue_wf is-exception_wf has-value_wf_base assert_wf false_wf true_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut thin isinrCases divergentSqle hypothesis because_Cache sqequalRule lambdaFormation lemma_by_obid sqequalHypSubstitution isectElimination sqequalAxiom isect_memberEquality hypothesisEquality voidElimination independent_functionElimination baseClosed voidEquality equalityTransitivity equalitySymmetry

\mforall{}[t:Base].  (t  \msim{}  inr  outr(t)  )  supposing  ((\muparrow{}isinr(t))  and  (t)\mdownarrow{})

Date html generated: 2016_05_13-PM-03_27_52
Last ObjectModification: 2016_01_14-PM-06_43_32

Theory : call!by!value_1

Home Index