Nuprl Lemma : list-eo-E-sq

[L,i:Top].  (E {e:ℕ| ↑e <||L||} )


Proof




Definitions occuring in Statement :  list-eo: list-eo(L;i) es-E: E length: ||as|| nat: assert: b lt_int: i <j uall: [x:A]. B[x] top: Top set: {x:A| B[x]}  sqequal: t
Definitions unfolded in proof :  btrue: tt mk-eo-record: mk-eo-record(E;dom;l;R;locless;pred;rank) mk-eo: mk-eo(E;dom;l;R;locless;pred;rank) bfalse: ff ifthenelse: if then else fi  eq_atom: =a y top: Top member: t ∈ T all: x:A. B[x] mk-extended-eo: mk-extended-eo es-E: E list-eo: list-eo(L;i) uall: [x:A]. B[x]

Latex:
\mforall{}[L,i:Top].    (E  \msim{}  \{e:\mBbbN{}|  \muparrow{}e  <z  ||L||\}  )



Date html generated: 2016_05_17-AM-08_21_45
Last ObjectModification: 2015_12_28-PM-11_03_24

Theory : event-ordering


Home Index