Nuprl Lemma : dl-obj-prog_wf
∀[x:dl-Obj()]. dl-obj-prog(x) ∈ Prog supposing dl-kind(x) = "prog" ∈ Atom
Proof
Definitions occuring in Statement :
dl-obj-prog: dl-obj-prog(x),
dl-kind: dl-kind(d),
dl-prog: Prog,
dl-Obj: dl-Obj(),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
token: "$token",
atom: Atom,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
member: t ∈ T,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
dl-Obj: dl-Obj(),
mobj: mobj(L),
dl-kind: dl-kind(d),
mobj-kind: mobj-kind(x),
pi1: fst(t),
sq_type: SQType(T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
guard: {T},
dl-obj-prog: dl-obj-prog(x),
pi2: snd(t),
mtype: mtype(L;i),
apply_alist: apply_alist(eq;L;x),
eager-map: eager-map(f;as),
list_ind: list_ind,
dl-Spec: dl-Spec(),
cons: [a / b],
nil: [],
it: ⋅,
atom-deq: AtomDeq,
eq_atom: x =a y,
btrue: tt,
mrec: mrec(L;i),
prec: prec(lbl,p.a[lbl; p];i),
dl-prog: Prog
Lemmas referenced :
istype-atom,
dl-kind_wf,
set_subtype_base,
l_member_wf,
cons_wf,
nil_wf,
atom_subtype_base,
dl-Obj_wf,
subtype_base_sq,
dl-prog_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
cut,
sqequalHypSubstitution,
hypothesis,
equalityIstype,
introduction,
extract_by_obid,
isectElimination,
thin,
hypothesisEquality,
applyEquality,
atomEquality,
sqequalRule,
lambdaEquality_alt,
tokenEquality,
independent_isectElimination,
baseClosed,
sqequalBase,
equalitySymmetry,
universeIsType,
productElimination,
instantiate,
cumulativity,
dependent_functionElimination,
equalityTransitivity,
independent_functionElimination,
hyp_replacement
Latex:
\mforall{}[x:dl-Obj()]. dl-obj-prog(x) \mmember{} Prog supposing dl-kind(x) = "prog"
Date html generated:
2019_10_15-AM-11_42_34
Last ObjectModification:
2019_04_04-PM-06_27_10
Theory : dynamic!logic
Home
Index