Nuprl Lemma : locl-pre-preserving-1-1

[es:EO]. ∀[P:E ⟶ ℙ]. ∀[f:{e:E| e}  ⟶ E].  Inj({e:E| e} ;E;f) supposing is locl-pre-preserving on P


Proof




Definitions occuring in Statement :  locl-pre-preserving: is locl-pre-preserving on P es-E: E event_ordering: EO inject: Inj(A;B;f) uimplies: supposing a uall: [x:A]. B[x] prop: set: {x:A| B[x]}  apply: a function: x:A ⟶ B[x]
Definitions unfolded in proof :  locl-pre-preserving: is locl-pre-preserving on P rel-pre-preserving: is R-pre-preserving on P uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a inject: Inj(A;B;f) all: x:A. B[x] implies:  Q subtype_rel: A ⊆B prop: refl: Refl(T;x,y.E[x; y]) anti_sym: AntiSym(T;x,y.R[x; y]) guard: {T}

Latex:
\mforall{}[es:EO].  \mforall{}[P:E  {}\mrightarrow{}  \mBbbP{}].  \mforall{}[f:\{e:E|  P  e\}    {}\mrightarrow{}  E].
    Inj(\{e:E|  P  e\}  ;E;f)  supposing  f  is  locl-pre-preserving  on  P



Date html generated: 2016_05_16-AM-10_21_01
Last ObjectModification: 2015_12_28-PM-09_22_22

Theory : new!event-ordering


Home Index