Nuprl Lemma : normal-ds-join
∀ds1,ds2:x:Id fp-> Type. (Normal(ds1) ⇒ Normal(ds2) ⇒ Normal(ds1 ⊕ ds2))
Proof
Definitions occuring in Statement :
normal-ds: Normal(ds),
fpf-join: f ⊕ g,
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 :
member: t ∈ T,
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
or: P ∨ Q,
not: ¬A,
false: False,
normal-ds: Normal(ds),
fpf-all: ∀x∈dom(f). v=f(x) ⇒ P[x; v],
top: Top,
so_lambda: λ2x.t[x],
so_apply: x[s],
iff: P ⇐⇒ Q,
and: P ∧ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
uimplies: b supposing a,
ifthenelse: if b then t else f fi ,
bfalse: ff,
prop: ℙ
Latex:
\mforall{}ds1,ds2:x:Id fp-> Type. (Normal(ds1) {}\mRightarrow{} Normal(ds2) {}\mRightarrow{} Normal(ds1 \moplus{} ds2))
Date html generated:
2016_05_16-AM-11_40_59
Last ObjectModification:
2015_12_29-AM-09_35_27
Theory : event-ordering
Home
Index