Nuprl Lemma : Q-R-glues_wf
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[Qa,Rb:E ⟶ E ⟶ ℙ]. ∀[A,B:Type]. ∀[Ia:EClass(A)]. ∀[Ib:EClass(B)]. ∀[f:E(Ia) ⟶ B].
∀[g:E(Ib) ⟶ E].
(g glues Ia:Qa ──f⟶ Ib:Rb ∈ ℙ)
Proof
Definitions occuring in Statement :
Q-R-glues: g glues Ia:Qa ──f⟶ Ib:Rb,
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
so_apply: x[s],
true: True,
btrue: tt,
ifthenelse: if b then t else f fi ,
assert: ↑b,
guard: {T},
implies: P ⇒ Q,
sq_type: SQType(T),
es-E-interface: E(X),
so_lambda: λ2x.t[x],
uimplies: b supposing a,
so_apply: x[s1;s2],
so_lambda: λ2x y.t[x; y],
cand: A c∧ B,
top: Top,
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
and: P ∧ Q,
prop: ℙ,
Q-R-glues: g glues Ia:Qa ──f⟶ Ib:Rb,
member: t ∈ T,
uall: ∀[x:A]. B[x],
weak-antecedent-function: Q ←==f== P,
es-interface-predicate: {I},
weak-antecedent-surjection: Q ←←= f== P
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[Qa,Rb:E {}\mrightarrow{} E {}\mrightarrow{} \mBbbP{}]. \mforall{}[A,B:Type]. \mforall{}[Ia:EClass(A)]. \mforall{}[Ib:EClass(B)].
\mforall{}[f:E(Ia) {}\mrightarrow{} B]. \mforall{}[g:E(Ib) {}\mrightarrow{} E].
(g glues Ia:Qa {}{}f{}\mrightarrow{} Ib:Rb \mmember{} \mBbbP{})
Date html generated:
2016_05_17-AM-07_48_51
Last ObjectModification:
2015_12_28-PM-11_31_50
Theory : event-ordering
Home
Index