Nuprl Lemma : rcv_one_one
∀[l1,l2:IdLnk]. ∀[tg1,tg2:Id]. {(l1 = l2 ∈ IdLnk) ∧ (tg1 = tg2 ∈ Id)} supposing rcv(l1,tg1) = rcv(l2,tg2) ∈ Knd
Proof
Definitions occuring in Statement :
rcv: rcv(l,tg),
Knd: Knd,
IdLnk: IdLnk,
Id: Id,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
guard: {T},
and: P ∧ Q,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
guard: {T},
and: P ∧ Q,
prop: ℙ,
rcv: rcv(l,tg),
Knd: Knd,
cand: A c∧ B,
pi1: fst(t),
outl: outl(x),
isl: isl(x),
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x],
top: Top,
pi2: snd(t)
Latex:
\mforall{}[l1,l2:IdLnk]. \mforall{}[tg1,tg2:Id]. \{(l1 = l2) \mwedge{} (tg1 = tg2)\} supposing rcv(l1,tg1) = rcv(l2,tg2)
Date html generated:
2016_05_16-AM-10_54_41
Last ObjectModification:
2015_12_29-AM-09_09_00
Theory : event-ordering
Home
Index