Nuprl Lemma : es-interface-buffer_wf
∀[Info,A1:Type]. ∀[n:ℕ]. ∀[X:EClass(A1)]. (Buffer(n;X) ∈ EClass(A1 List))
Proof
Definitions occuring in Statement :
es-interface-buffer: Buffer(n;X),
eclass: EClass(A[eo; e]),
list: T List,
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-interface-buffer: Buffer(n;X),
eclass: EClass(A[eo; e]),
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,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
and: P ∧ Q,
es-E-interface: E(X),
nat: ℕ,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False
Latex:
\mforall{}[Info,A1:Type]. \mforall{}[n:\mBbbN{}]. \mforall{}[X:EClass(A1)]. (Buffer(n;X) \mmember{} EClass(A1 List))
Date html generated:
2016_05_17-AM-07_22_00
Last ObjectModification:
2015_12_28-PM-11_55_20
Theory : event-ordering
Home
Index