Nuprl Lemma : normal-da-join
∀[da1,da2:x:Knd fp-> Type]. (Normal(da1 ⊕ da2)) supposing (Normal(da2) and Normal(da1))
Proof
Definitions occuring in Statement :
normal-da: Normal(da),
fpf-join: f ⊕ g,
fpf: a:A fp-> B[a],
Kind-deq: KindDeq,
Knd: Knd,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
normal-da: Normal(da),
true: True,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[da1,da2:x:Knd fp-> Type]. (Normal(da1 \moplus{} da2)) supposing (Normal(da2) and Normal(da1))
Date html generated:
2016_05_16-AM-11_41_25
Last ObjectModification:
2015_12_29-AM-09_35_15
Theory : event-ordering
Home
Index