Nuprl Lemma : es-before-no_repeats
∀[es:EO]. ∀[e:E]. no_repeats(E;before(e))
Proof
Definitions occuring in Statement :
es-before: before(e),
es-E: E,
event_ordering: EO,
no_repeats: no_repeats(T;l),
uall: ∀[x:A]. B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
subtype_rel: A ⊆r B,
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
squash: ↓T,
no_repeats: no_repeats(T;l),
es-before: before(e),
sq_type: SQType(T),
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
btrue: tt,
bfalse: ff,
le: A ≤ B,
less_than': less_than'(a;b),
assert: ↑b,
iff: P ⇐⇒ Q,
true: True,
rev_implies: P ⇐ Q,
select: L[n],
cons: [a / b],
int_seg: {i..j-},
lelt: i ≤ j < k
Latex:
\mforall{}[es:EO]. \mforall{}[e:E]. no\_repeats(E;before(e))
Date html generated:
2016_05_16-AM-09_37_54
Last ObjectModification:
2016_01_17-PM-01_29_07
Theory : new!event-ordering
Home
Index