Nuprl Lemma : implies-normal-ds
∀ds:x:Id fp-> Type. (∀x∈dom(ds). A=ds(x) ⇒ A ⇒ Normal(ds))
Proof
Definitions occuring in Statement :
normal-ds: Normal(ds),
fpf-all: ∀x∈dom(f). v=f(x) ⇒ P[x; v],
fpf: a:A fp-> B[a],
id-deq: IdDeq,
Id: Id,
all: ∀x:A. B[x],
implies: P ⇒ Q,
universe: Type
Definitions unfolded in proof :
normal-ds: Normal(ds),
fpf-all: ∀x∈dom(f). v=f(x) ⇒ P[x; v],
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
top: Top,
guard: {T}
Latex:
\mforall{}ds:x:Id fp-> Type. (\mforall{}x\mmember{}dom(ds). A=ds(x) {}\mRightarrow{} A {}\mRightarrow{} Normal(ds))
Date html generated:
2016_05_16-AM-11_40_43
Last ObjectModification:
2015_12_29-AM-09_34_43
Theory : event-ordering
Home
Index