Nuprl Lemma : fpf-join-cap
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[f,g:a:A fp-> Top]. ∀[x:A]. ∀[z:Top]. (f ⊕ g(x)?z ~ f(x)?g(x)?z)
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
top: Top,
universe: Type,
sqequal: s ~ t
Lemmas :
fpf-join-ap-sq,
fpf-dom_wf,
fpf-join_wf,
bool_wf,
equal-wf-T-base,
assert_wf,
bnot_wf,
not_wf,
fpf-join-dom,
or_wf,
top_wf,
fpf_wf,
deq_wf,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> Top]. \mforall{}[x:A]. \mforall{}[z:Top]. (f \moplus{} g(x)?z \msim{} f(x)?g(x)?z)
Date html generated:
2015_07_17-AM-09_20_11
Last ObjectModification:
2015_01_28-AM-07_48_20
Home
Index