Nuprl Lemma : bag-member-classfun
∀[Info,T:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(T)]. ∀[e:E]. X(e) ↓∈ X es e supposing X is functional
Proof
Definitions occuring in Statement :
classfun: X(e),
es-functional-class: X is functional,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
apply: f a,
universe: Type,
bag-member: x ↓∈ bs
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
es-functional-class: X is functional,
and: P ∧ Q,
single-valued-classrel: single-valued-classrel(es;X;T),
all: ∀x:A. B[x],
es-total-class: es-total-class(es;X),
classfun: X(e),
class-ap: X(e),
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
implies: P ⇒ Q,
single-valued-bag: single-valued-bag(b;T),
bag-member: x ↓∈ bs,
squash: ↓T,
subtype_rel: A ⊆r B,
prop: ℙ,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
decidable: Dec(P),
or: P ∨ Q,
le: A ≤ B,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
top: Top,
nat: ℕ
Latex:
\mforall{}[Info,T:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(T)]. \mforall{}[e:E]. X(e) \mdownarrow{}\mmember{} X es e supposing X is functional
Date html generated:
2016_05_16-PM-01_44_01
Last ObjectModification:
2016_01_17-PM-07_48_57
Theory : event-ordering
Home
Index