Nuprl Lemma : Q-R-glued-composes
∀[Info:Type]
∀es:EO+(Info)
∀[Qa,Rb,Sc:E ⟶ E ⟶ ℙ]. ∀[A,B,C:Type].
∀Ia:EClass(A). ∀Ib:EClass(B). ∀Ic:EClass(C). ∀f1:E(Ia) ⟶ B. ∀f2:B ⟶ C.
((Ia:Qa →─f1⟶ Ib:Rb ∧ Ib:Rb →─λe.(f2 Ib(e))⟶ Ic:Sc) ⇒ Ia:Qa →─f2 o f1⟶ Ic:Sc)
Proof
Definitions occuring in Statement :
Q-R-glued: Ia:Qa →─f⟶ Ib:Rb,
es-E-interface: E(X),
eclass-val: X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
compose: f o g,
uall: ∀[x:A]. B[x],
prop: ℙ,
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
apply: f a,
lambda: λx.A[x],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
true: True,
btrue: tt,
ifthenelse: if b then t else f fi ,
assert: ↑b,
guard: {T},
sq_type: SQType(T),
top: Top,
uimplies: b supposing a,
es-E-interface: E(X),
so_apply: x[s1;s2],
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
prop: ℙ,
member: t ∈ T,
exists: ∃x:A. B[x],
Q-R-glued: Ia:Qa →─f⟶ Ib:Rb,
and: P ∧ Q,
implies: P ⇒ Q,
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
cand: A c∧ B
Latex:
\mforall{}[Info:Type]
\mforall{}es:EO+(Info)
\mforall{}[Qa,Rb,Sc:E {}\mrightarrow{} E {}\mrightarrow{} \mBbbP{}]. \mforall{}[A,B,C:Type].
\mforall{}Ia:EClass(A). \mforall{}Ib:EClass(B). \mforall{}Ic:EClass(C). \mforall{}f1:E(Ia) {}\mrightarrow{} B. \mforall{}f2:B {}\mrightarrow{} C.
((Ia:Qa \mrightarrow{}{}f1{}\mrightarrow{} Ib:Rb \mwedge{} Ib:Rb \mrightarrow{}{}\mlambda{}e.(f2 Ib(e)){}\mrightarrow{} Ic:Sc) {}\mRightarrow{} Ia:Qa \mrightarrow{}{}f2 o f1{}\mrightarrow{} Ic:Sc)
Date html generated:
2016_05_17-AM-07_56_19
Last ObjectModification:
2015_12_28-PM-11_25_45
Theory : event-ordering
Home
Index