Nuprl Lemma : es-fix-test
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:E(X) ⟶ E(X)].
∀[e:E(X)]
(((f f**(e)) = f**(e) ∈ E(X))
∧ (f**(f e) = f**(e) ∈ E(X))
∧ (∀[a:E(X)]. f**(a) = f**(e) ∈ E(X) supposing a is f*(e)))
supposing ∀x:E(X). f x c≤ x
Proof
Definitions occuring in Statement :
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],
and: P ∧ Q,
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T,
fun-connected: y is f*(x)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
and: P ∧ Q,
cand: A c∧ B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
es-E-interface: E(X),
subtype_rel: A ⊆r B,
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:E(X) {}\mrightarrow{} E(X)].
\mforall{}[e:E(X)]
(((f f**(e)) = f**(e))
\mwedge{} (f**(f e) = f**(e))
\mwedge{} (\mforall{}[a:E(X)]. f**(a) = f**(e) supposing a is f*(e)))
supposing \mforall{}x:E(X). f x c\mleq{} x
Date html generated:
2016_05_16-PM-10_19_08
Last ObjectModification:
2015_12_29-AM-11_14_46
Theory : event-ordering
Home
Index