Nuprl Lemma : es-interface-map_wf
∀[Info,A,B:Type]. ∀[X:EClass(A)]. ∀[f:⋂es:EO+(Info). (A ⟶ E(X) ⟶ bag(B))]. (es-interface-map(f;X) ∈ EClass(B))
Proof
Definitions occuring in Statement :
es-interface-map: es-interface-map(f;X),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
uall: ∀[x:A]. B[x],
member: t ∈ T,
isect: ⋂x:A. B[x],
function: x:A ⟶ B[x],
universe: Type,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-interface-map: es-interface-map(f;X),
eclass: EClass(A[eo; e]),
let: let,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
nat: ℕ,
and: P ∧ Q,
cand: A c∧ B,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
prop: ℙ,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
es-E-interface: E(X),
in-eclass: e ∈b X,
rev_uimplies: rev_uimplies(P;Q)
Latex:
\mforall{}[Info,A,B:Type]. \mforall{}[X:EClass(A)]. \mforall{}[f:\mcap{}es:EO+(Info). (A {}\mrightarrow{} E(X) {}\mrightarrow{} bag(B))].
(es-interface-map(f;X) \mmember{} EClass(B))
Date html generated:
2016_05_16-PM-10_33_01
Last ObjectModification:
2016_01_17-PM-07_22_18
Theory : event-ordering
Home
Index