Nuprl Lemma : es-rank_le
∀[es:EO]. ∀[e1,e2:E]. es-rank(es;e1) ≤ es-rank(es;e2) supposing e1 c≤ e2
Proof
Definitions occuring in Statement :
es-causle: e c≤ e',
es-rank: es-rank(es;e),
es-E: E,
event_ordering: EO,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
le: A ≤ B
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
es-causle: e c≤ e',
or: P ∨ Q,
le: A ≤ B,
and: P ∧ Q,
not: ¬A,
implies: P ⇒ Q,
false: False,
subtype_rel: A ⊆r B,
prop: ℙ,
all: ∀x:A. B[x],
nat: ℕ,
decidable: Dec(P),
less_than: a < b,
squash: ↓T,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top
Latex:
\mforall{}[es:EO]. \mforall{}[e1,e2:E]. es-rank(es;e1) \mleq{} es-rank(es;e2) supposing e1 c\mleq{} e2
Date html generated:
2016_05_16-AM-10_24_25
Last ObjectModification:
2016_01_17-PM-01_20_53
Theory : new!event-ordering
Home
Index