Nuprl Lemma : lnk-decl-ap
∀[k:Knd]. ∀[l:IdLnk]. ∀[dt:x:Id fp-> Type]. lnk-decl(l;dt)(k) ~ dt(tag(k)) supposing ↑k ∈ dom(lnk-decl(l;dt))
Proof
Definitions occuring in Statement :
lnk-decl: lnk-decl(l;dt),
fpf-ap: f(x),
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
Kind-deq: KindDeq,
tagof: tag(k),
Knd: Knd,
IdLnk: IdLnk,
id-deq: IdDeq,
Id: Id,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
sqequal: s ~ t
Lemmas :
assert_wf,
fpf-dom_wf,
Knd_wf,
Kind-deq_wf,
lnk-decl_wf-hasloc,
subtype-fpf3,
hasloc_wf,
ldst_wf,
top_wf,
strong-subtype-set2,
subtype_top,
set_wf,
fpf_wf,
Id_wf,
IdLnk_wf,
lnk-decl-dom2,
subtype_base_sq,
product_subtype_base,
atom2_subtype_base,
lnk-decl-dom,
lnk-decl-cap,
rcv_wf,
bool_wf,
equal-wf-T-base,
bnot_wf,
not_wf,
id-deq_wf,
subtype-fpf2,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
lnk-decl-dom-not
\mforall{}[k:Knd]. \mforall{}[l:IdLnk]. \mforall{}[dt:x:Id fp-> Type].
lnk-decl(l;dt)(k) \msim{} dt(tag(k)) supposing \muparrow{}k \mmember{} dom(lnk-decl(l;dt))
Date html generated:
2015_07_17-AM-11_15_55
Last ObjectModification:
2015_01_28-AM-07_38_42
Home
Index