Nuprl Lemma : fpf-all-join-decl
∀[A:Type]
∀eq:EqDecider(A)
∀[P:x:A ⟶ Type ⟶ ℙ]
∀f,g:x:A fp-> Type.
(∀y∈dom(f). w=f(y) ⇒ P[y;w] ⇒ ∀y∈dom(g). w=g(y) ⇒ P[y;w] ⇒ ∀y∈dom(f ⊕ g). w=f ⊕ g(y) ⇒ P[y;w])
Proof
Definitions occuring in Statement :
fpf-all: ∀x∈dom(f). v=f(x) ⇒ P[x; v],
fpf-join: f ⊕ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s1;s2],
all: ∀x:A. B[x],
implies: 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-all: ∀x∈dom(f). v=f(x) ⇒ P[x; v],
member: t ∈ T,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
top: Top,
iff: P ⇐⇒ Q,
and: P ∧ Q,
prop: ℙ,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
guard: {T},
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff,
or: P ∨ Q,
not: ¬A,
false: False
Latex:
\mforall{}[A:Type]
\mforall{}eq:EqDecider(A)
\mforall{}[P:x:A {}\mrightarrow{} Type {}\mrightarrow{} \mBbbP{}]
\mforall{}f,g:x:A fp-> Type.
(\mforall{}y\mmember{}dom(f). w=f(y) {}\mRightarrow{} P[y;w]
{}\mRightarrow{} \mforall{}y\mmember{}dom(g). w=g(y) {}\mRightarrow{} P[y;w]
{}\mRightarrow{} \mforall{}y\mmember{}dom(f \moplus{} g). w=f \moplus{} g(y) {}\mRightarrow{} P[y;w])
Date html generated:
2016_05_16-AM-11_31_45
Last ObjectModification:
2015_12_29-AM-09_28_05
Theory : event-ordering
Home
Index