Nuprl Lemma : loop2-classrel
∀[Info,B:Type]. ∀[X:EClass(B ⟶ B)]. ∀[init:Id ⟶ bag(B)]. ∀[es:EO+(Info)]. ∀[e:E]. ∀[v:B].
uiff(v ∈ loop-class2(X;init)(e);↓∃f:B ⟶ B
∃b:B. (f ∈ X(e) ∧ b ∈ Prior(loop-class2(X;init))?init(e) ∧ (v = (f b) ∈ B)))
Proof
Definitions occuring in Statement :
loop-class2: loop-class2(X;init),
primed-class-opt: Prior(X)?b,
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
Id: Id,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
exists: ∃x:A. B[x],
squash: ↓T,
and: P ∧ Q,
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T,
bag: bag(T)
Definitions unfolded in proof :
loop-class2: loop-class2(X;init),
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
squash: ↓T,
prop: ℙ,
classrel: v ∈ X(e),
bag-member: x ↓∈ bs
Latex:
\mforall{}[Info,B:Type]. \mforall{}[X:EClass(B {}\mrightarrow{} B)]. \mforall{}[init:Id {}\mrightarrow{} bag(B)]. \mforall{}[es:EO+(Info)]. \mforall{}[e:E]. \mforall{}[v:B].
uiff(v \mmember{} loop-class2(X;init)(e);\mdownarrow{}\mexists{}f:B {}\mrightarrow{} B
\mexists{}b:B
(f \mmember{} X(e)
\mwedge{} b \mmember{} Prior(loop-class2(X;init))?init(e)
\mwedge{} (v = (f b))))
Date html generated:
2016_05_16-PM-11_34_10
Last ObjectModification:
2016_01_17-PM-07_05_25
Theory : event-ordering
Home
Index