Nuprl Lemma : fpf-join-sub2
∀[A:Type]. ∀[B:A ─→ Type]. ∀[eq:EqDecider(A)]. ∀[f1,g,f2:a:A fp-> B[a]]. (f1 ⊕ f2 ⊆ g) supposing (f2 ⊆ g and f1 ⊆ g)
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-sub: f ⊆ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ─→ B[x],
universe: Type
Lemmas :
fpf-sub_witness,
fpf-join_wf,
fpf-sub_wf,
fpf_wf,
deq_wf,
fpf-join-sub,
fpf-join-idempotent,
iff_weakening_equal,
assert_wf,
fpf-dom_wf,
subtype-fpf2,
top_wf,
subtype_top
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f1,g,f2:a:A fp-> B[a]].
(f1 \moplus{} f2 \msubseteq{} g) supposing (f2 \msubseteq{} g and f1 \msubseteq{} g)
Date html generated:
2015_07_17-AM-09_20_43
Last ObjectModification:
2015_02_04-PM-05_07_08
Home
Index