Nuprl Lemma : fpf-split
∀[A:Type]
∀eq:EqDecider(A)
∀[B:A ⟶ Type]
∀f:a:A fp-> B[a]
∀[P:A ⟶ ℙ]
((∀a:A. Dec(P[a]))
⇒ (∃fp,fnp:a:A fp-> B[a]
((f ⊆ fp ⊕ fnp ∧ fp ⊕ fnp ⊆ f)
∧ ((∀a:A. P[a] supposing ↑a ∈ dom(fp)) ∧ (∀a:A. ¬P[a] supposing ↑a ∈ dom(fnp)))
∧ fpf-domain(fp) ⊆ fpf-domain(f)
∧ fpf-domain(fnp) ⊆ fpf-domain(f))))
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-sub: f ⊆ g,
fpf-domain: fpf-domain(f),
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
sublist: L1 ⊆ L2,
deq: EqDecider(T),
assert: ↑b,
decidable: Dec(P),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
not: ¬A,
implies: P ⇒ Q,
and: P ∧ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
fpf: a:A fp-> B[a],
member: t ∈ T,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
iff: P ⇐⇒ Q,
and: P ∧ Q,
exists: ∃x:A. B[x],
cand: A c∧ B,
guard: {T},
top: Top,
not: ¬A,
false: False,
fpf-join: f ⊕ g,
fpf-sub: f ⊆ g,
pi1: fst(t),
fpf-cap: f(x)?z,
fpf-dom: x ∈ dom(f),
rev_implies: P ⇐ Q,
or: P ∨ Q,
decidable: Dec(P),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
uiff: uiff(P;Q),
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
fpf-domain: fpf-domain(f)
Latex:
\mforall{}[A:Type]
\mforall{}eq:EqDecider(A)
\mforall{}[B:A {}\mrightarrow{} Type]
\mforall{}f:a:A fp-> B[a]
\mforall{}[P:A {}\mrightarrow{} \mBbbP{}]
((\mforall{}a:A. Dec(P[a]))
{}\mRightarrow{} (\mexists{}fp,fnp:a:A fp-> B[a]
((f \msubseteq{} fp \moplus{} fnp \mwedge{} fp \moplus{} fnp \msubseteq{} f)
\mwedge{} ((\mforall{}a:A. P[a] supposing \muparrow{}a \mmember{} dom(fp)) \mwedge{} (\mforall{}a:A. \mneg{}P[a] supposing \muparrow{}a \mmember{} dom(fnp)))
\mwedge{} fpf-domain(fp) \msubseteq{} fpf-domain(f)
\mwedge{} fpf-domain(fnp) \msubseteq{} fpf-domain(f))))
Date html generated:
2016_05_16-AM-11_16_55
Last ObjectModification:
2015_12_29-AM-09_32_39
Theory : event-ordering
Home
Index