Nuprl Lemma : es-fix_wf
∀[es:EO]. ∀[T:Type]. ∀[f:T ─→ T]. ∀[e:T]. (f**(e) ∈ T) supposing ∀x:T. f x c≤ x supposing strong-subtype(T;E)
Proof
Definitions occuring in Statement :
es-fix: f**(e),
es-causle: e c≤ e',
es-E: E,
event_ordering: EO,
strong-subtype: strong-subtype(A;B),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
member: t ∈ T,
apply: f a,
function: x:A ─→ B[x],
universe: Type
Lemmas :
all_wf,
es-causle_wf,
strong-subtype_wf,
es-E_wf,
event_ordering_wf,
fix_wf,
es-eq_wf,
strong-subtype-deq-subtype,
es-causle-retraction
\mforall{}[es:EO]. \mforall{}[T:Type].
\mforall{}[f:T {}\mrightarrow{} T]. \mforall{}[e:T]. (f**(e) \mmember{} T) supposing \mforall{}x:T. f x c\mleq{} x supposing strong-subtype(T;E)
Date html generated:
2015_07_17-AM-08_38_44
Last ObjectModification:
2015_01_27-PM-02_43_12
Home
Index