Nuprl Lemma : lnk-decl-dom-join
∀[l:IdLnk]. ∀[k:Knd]. ∀[dt1,dt2:tg:Id fp-> Type].
(k ∈ dom(lnk-decl(l;dt1 ⊕ dt2)) ~ k ∈ dom(lnk-decl(l;dt1)) ∨bk ∈ dom(lnk-decl(l;dt2)))
Proof
Definitions occuring in Statement :
lnk-decl: lnk-decl(l;dt),
fpf-join: f ⊕ g,
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
Kind-deq: KindDeq,
Knd: Knd,
IdLnk: IdLnk,
id-deq: IdDeq,
Id: Id,
bor: p ∨bq,
uall: ∀[x:A]. B[x],
universe: Type,
sqequal: s ~ t
Lemmas :
subtype_base_sq,
bool_wf,
bool_subtype_base,
iff_imp_equal_bool,
fpf_wf,
Id_wf,
Knd_wf,
IdLnk_wf,
map_append_sq,
member_map_filter,
bnot_wf,
deq-member_wf,
id-deq_wf,
assert_wf,
rcv_wf,
exists_wf,
l_member_wf,
or_wf,
map_wf,
mapfilter_wf,
iff_wf,
member_append,
filter_wf5,
append_wf,
member_map,
not_wf,
equal_wf,
Kind-deq_wf,
bor_wf,
assert-deq-member,
iff_transitivity,
iff_weakening_uiff,
assert_of_bor,
cand_functionality_wrt_iff,
assert_of_bnot,
iff_weakening_equal,
decidable__l_member,
decidable__equal_Id
\mforall{}[l:IdLnk]. \mforall{}[k:Knd]. \mforall{}[dt1,dt2:tg:Id fp-> Type].
(k \mmember{} dom(lnk-decl(l;dt1 \moplus{} dt2)) \msim{} k \mmember{} dom(lnk-decl(l;dt1)) \mvee{}\msubb{}k \mmember{} dom(lnk-decl(l;dt2)))
Date html generated:
2015_07_17-AM-11_15_39
Last ObjectModification:
2015_02_04-PM-05_06_13
Home
Index