Nuprl Lemma : not_rcv_locl
∀[a:Id]. ∀[l:IdLnk]. ∀[tg:Id]. False supposing rcv(l,tg) = locl(a) ∈ Knd
Proof
Definitions occuring in Statement :
locl: locl(a),
rcv: rcv(l,tg),
Knd: Knd,
IdLnk: IdLnk,
Id: Id,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
false: False,
equal: s = t ∈ T
Definitions unfolded in proof :
locl: locl(a),
Knd: Knd,
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
false: False,
prop: ℙ,
subtype_rel: A ⊆r B,
rcv: rcv(l,tg),
sq_type: SQType(T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
guard: {T},
true: True
Latex:
\mforall{}[a:Id]. \mforall{}[l:IdLnk]. \mforall{}[tg:Id]. False supposing rcv(l,tg) = locl(a)
Date html generated:
2016_05_16-AM-10_54_44
Last ObjectModification:
2015_12_29-AM-09_08_12
Theory : event-ordering
Home
Index