Nuprl Lemma : lnk-decl-cap2
∀[l1,l2:IdLnk]. ∀[dt:tg:Id fp-> Type]. ∀[tg:Id]. ∀[T:Type].
(lnk-decl(l1;dt)(rcv(l2,tg))?T ~ if l1 = l2 then dt(tg)?T else T fi )
Proof
Definitions occuring in Statement :
lnk-decl: lnk-decl(l;dt),
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
Kind-deq: KindDeq,
eq_lnk: a = b,
rcv: rcv(l,tg),
IdLnk: IdLnk,
id-deq: IdDeq,
Id: Id,
ifthenelse: if b then t else f fi ,
uall: ∀[x:A]. B[x],
universe: Type,
sqequal: s ~ t
Lemmas :
subtype_base_sq,
IdLnk_wf,
product_subtype_base,
Id_wf,
atom2_subtype_base,
lnk-decl-cap,
fpf-dom_wf,
Knd_wf,
Kind-deq_wf,
lnk-decl_wf-hasloc,
subtype-fpf3,
assert_wf,
hasloc_wf,
ldst_wf,
top_wf,
strong-subtype-set2,
subtype_top,
set_wf,
rcv_wf,
bool_wf,
equal-wf-T-base,
bnot_wf,
not_wf,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
lnk-decl-dom2
\mforall{}[l1,l2:IdLnk]. \mforall{}[dt:tg:Id fp-> Type]. \mforall{}[tg:Id]. \mforall{}[T:Type].
(lnk-decl(l1;dt)(rcv(l2,tg))?T \msim{} if l1 = l2 then dt(tg)?T else T fi )
Date html generated:
2015_07_17-AM-11_15_50
Last ObjectModification:
2015_01_28-AM-07_38_23
Home
Index