Nuprl Lemma : Memory-class-total
∀[Info,A,S:Type]. ∀[init:Id ⟶ bag(S)]. ∀[f:A ⟶ S ⟶ S]. ∀[X:EClass(A)]. ∀[es:EO+(Info)].
es-total-class(es;Memory-class(f;init;X)) supposing ∀l:Id. (1 ≤ #(init l))
Proof
Definitions occuring in Statement :
Memory-class: Memory-class(f;init;X),
es-total-class: es-total-class(es;X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
Id: Id,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
le: A ≤ B,
all: ∀x:A. B[x],
apply: f a,
function: x:A ⟶ B[x],
natural_number: $n,
universe: Type,
bag-size: #(bs),
bag: bag(T)
Definitions unfolded in proof :
es-total-class: es-total-class(es;X),
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
nat: ℕ,
decidable: Dec(P),
or: P ∨ Q,
le: A ≤ B,
and: P ∧ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
prop: ℙ,
classrel: v ∈ X(e),
class-ap: X(e),
eclass: EClass(A[eo; e]),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uiff: uiff(P;Q),
less_than: a < b,
squash: ↓T,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[Info,A,S:Type]. \mforall{}[init:Id {}\mrightarrow{} bag(S)]. \mforall{}[f:A {}\mrightarrow{} S {}\mrightarrow{} S]. \mforall{}[X:EClass(A)]. \mforall{}[es:EO+(Info)].
es-total-class(es;Memory-class(f;init;X)) supposing \mforall{}l:Id. (1 \mleq{} \#(init l))
Date html generated:
2016_05_17-AM-09_23_25
Last ObjectModification:
2016_01_17-PM-11_11_12
Theory : classrel!lemmas
Home
Index