Nuprl Lemma : es-prior-fixedpoints-fix
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:E(X) ⟶ E(X)].
∀[e:E(X)]. (prior-f-fixedpoints(e) ~ prior-f-fixedpoints(f**(e))) supposing ∀x:E(X). f x c≤ x
Proof
Definitions occuring in Statement :
es-prior-fixedpoints: prior-f-fixedpoints(e),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-fix: f**(e),
es-causle: e c≤ e',
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
so_apply: x[s1;s2],
so_lambda: λ2x y.t[x; y],
so_apply: x[s],
so_lambda: λ2x.t[x],
uall: ∀[x:A]. B[x],
or: P ∨ Q,
decidable: Dec(P),
es-E-interface: E(X),
subtype_rel: A ⊆r B,
member: t ∈ T,
all: ∀x:A. B[x],
uimplies: b supposing a,
prop: ℙ,
false: False,
implies: P ⇒ Q,
not: ¬A,
es-prior-fixedpoints: prior-f-fixedpoints(e),
sq_type: SQType(T),
guard: {T},
ifthenelse: if b then t else f fi ,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
bfalse: ff,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:E(X) {}\mrightarrow{} E(X)].
\mforall{}[e:E(X)]. (prior-f-fixedpoints(e) \msim{} prior-f-fixedpoints(f**(e))) supposing \mforall{}x:E(X). f x c\mleq{} x
Date html generated:
2016_05_17-AM-07_23_26
Last ObjectModification:
2015_12_28-PM-11_53_37
Theory : event-ordering
Home
Index