Nuprl Lemma : es-pred-loc-base

es:EO. ∀e:es-base-E(es).  (loc(pred(e)) loc(e) ∈ Id)


Proof




Definitions occuring in Statement :  es-pred: pred(e) es-loc: loc(e) es-base-E: es-base-E(es) event_ordering: EO Id: Id all: x:A. B[x] equal: t ∈ T
Definitions unfolded in proof :  all: x:A. B[x] member: t ∈ T uall: [x:A]. B[x] strongwellfounded: SWellFounded(R[x; y]) exists: x:A. B[x] nat: implies:  Q false: False ge: i ≥  uimplies: supposing a satisfiable_int_formula: satisfiable_int_formula(fmla) not: ¬A top: Top and: P ∧ Q prop: guard: {T} subtype_rel: A ⊆B int_seg: {i..j-} lelt: i ≤ j < k le: A ≤ B less_than': less_than'(a;b) decidable: Dec(P) or: P ∨ Q less_than: a < b squash: T es-pred: pred(e) let: let bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) ifthenelse: if then else fi  bfalse: ff sq_type: SQType(T) bnot: ¬bb assert: b deq: EqDecider(T)

Latex:
\mforall{}es:EO.  \mforall{}e:es-base-E(es).    (loc(pred(e))  =  loc(e))



Date html generated: 2016_05_16-AM-09_16_16
Last ObjectModification: 2016_01_17-PM-01_32_33

Theory : new!event-ordering


Home Index