Nuprl Lemma : has-valueall-lambda

[a:Base]. has-valueall(λx.a[x])


Proof




Definitions occuring in Statement :  has-valueall: has-valueall(a) uall: [x:A]. B[x] so_apply: x[s] lambda: λx.A[x] base: Base
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T has-valueall: has-valueall(a) evalall: evalall(t) has-value: (a)↓
Lemmas referenced :  base_wf is-exception_wf has-value_wf_base
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut sqequalRule divergentSqle sqleReflexivity lemma_by_obid sqequalHypSubstitution isectElimination thin baseClosed hypothesis axiomSqleEquality

Latex:
\mforall{}[a:Base].  has-valueall(\mlambda{}x.a[x])



Date html generated: 2016_05_13-PM-03_25_34
Last ObjectModification: 2016_01_14-PM-06_44_21

Theory : call!by!value_1


Home Index