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
Lemmas :
equal_wf,
Knd_wf,
rcv_wf,
Id_wf,
IdLnk_wf,
and_wf,
outl_wf,
assert_wf,
isl_wf,
pi1_wf_top,
subtype_rel_product,
top_wf,
subtype_top,
pi2_wf
\mforall{}[l1,l2:IdLnk]. \mforall{}[tg1,tg2:Id]. \{(l1 = l2) \mwedge{} (tg1 = tg2)\} supposing rcv(l1,tg1) = rcv(l2,tg2)
Date html generated:
2015_07_17-AM-09_11_25
Last ObjectModification:
2015_01_28-AM-07_58_28
Home
Index