Nuprl Lemma : lnk-decl-dom2
∀[l,l2:IdLnk]. ∀[dt:tg:Id fp-> Type]. ∀[tg:Id]. l2 = l ∈ IdLnk supposing ↑rcv(l2,tg) ∈ dom(lnk-decl(l;dt))
Proof
Definitions occuring in Statement :
lnk-decl: lnk-decl(l;dt),
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
Kind-deq: KindDeq,
rcv: rcv(l,tg),
IdLnk: IdLnk,
Id: Id,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Lemmas :
assert-deq-member,
Knd_wf,
Kind-deq_wf,
map_wf,
rcv_wf,
member_map,
rcv_one_one,
assert_wf,
fpf-dom_wf,
lnk-decl_wf-hasloc,
subtype-fpf3,
hasloc_wf,
ldst_wf,
top_wf,
strong-subtype-set2,
subtype_top,
set_wf,
Id_wf,
fpf_wf,
IdLnk_wf
\mforall{}[l,l2:IdLnk]. \mforall{}[dt:tg:Id fp-> Type]. \mforall{}[tg:Id]. l2 = l supposing \muparrow{}rcv(l2,tg) \mmember{} dom(lnk-decl(l;dt))
Date html generated:
2015_07_17-AM-11_15_45
Last ObjectModification:
2015_01_28-AM-07_38_37
Home
Index