Nuprl Lemma : eval_list_sq

`∀[t:Top List]. (eval_list(t) ~ t)`

Proof

Definitions occuring in Statement :  eval_list: `eval_list(t)` list: `T List` uall: `∀[x:A]. B[x]` top: `Top` sqequal: `s ~ t`
Definitions unfolded in proof :  eval_list: `eval_list(t)` uall: `∀[x:A]. B[x]` member: `t ∈ T` all: `∀x:A. B[x]` nat: `ℕ` implies: `P `` Q` false: `False` ge: `i ≥ j ` guard: `{T}` uimplies: `b supposing a` prop: `ℙ` subtype_rel: `A ⊆r B` or: `P ∨ Q` so_lambda: `so_lambda(x,y,z.t[x; y; z])` top: `Top` so_apply: `x[s1;s2;s3]` cons: `[a / b]` colength: `colength(L)` so_lambda: `λ2x y.t[x; y]` so_apply: `x[s1;s2]` squash: `↓T` sq_stable: `SqStable(P)` uiff: `uiff(P;Q)` and: `P ∧ Q` le: `A ≤ B` not: `¬A` less_than': `less_than'(a;b)` true: `True` decidable: `Dec(P)` iff: `P `⇐⇒` Q` rev_implies: `P `` Q` subtract: `n - m` nil: `[]` it: `⋅` so_lambda: `λ2x.t[x]` so_apply: `x[s]` sq_type: `SQType(T)` less_than: `a < b` has-value: `(a)↓`
Rules used in proof :  sqequalSubstitution sqequalRule sqequalReflexivity sqequalTransitivity computationStep isect_memberFormation introduction cut thin lambdaFormation extract_by_obid sqequalHypSubstitution isectElimination hypothesisEquality hypothesis setElimination rename intWeakElimination natural_numberEquality independent_isectElimination independent_functionElimination voidElimination lambdaEquality dependent_functionElimination sqequalAxiom applyEquality because_Cache unionElimination isect_memberEquality voidEquality promote_hyp hypothesis_subsumption productElimination applyLambdaEquality imageMemberEquality baseClosed imageElimination addEquality dependent_set_memberEquality independent_pairFormation minusEquality equalityTransitivity equalitySymmetry intEquality instantiate cumulativity callbyvalueReduce

Latex:
\mforall{}[t:Top  List].  (eval\_list(t)  \msim{}  t)

Date html generated: 2017_04_14-AM-08_53_15
Last ObjectModification: 2017_02_27-PM-03_38_08

Theory : list_0

Home Index