Nuprl Lemma : es-interface-count_wf
∀[Info:Type]. ∀[X:EClass(Top)]. (#X ∈ EClass(ℕ))
Proof
Definitions occuring in Statement :
es-interface-count: #X,
eclass: EClass(A[eo; e]),
nat: ℕ,
uall: ∀[x:A]. B[x],
top: Top,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-interface-count: #X,
eclass: EClass(A[eo; e]),
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
es-E-interface: E(X),
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[Info:Type]. \mforall{}[X:EClass(Top)]. (\#X \mmember{} EClass(\mBbbN{}))
Date html generated:
2016_05_16-PM-11_05_09
Last ObjectModification:
2015_12_29-AM-10_38_16
Theory : event-ordering
Home
Index