Nuprl Lemma : fpf-all-single
∀[A:Type]
∀eq:EqDecider(A)
∀[B:A ⟶ Type]. ∀[P:x:A ⟶ B[x] ⟶ ℙ]. ∀x:A. ∀v:B[x]. (∀y∈dom(x : v). w=x : v(y) ⇒ P[y;w] ⇐⇒ P[x;v])
Proof
Definitions occuring in Statement :
fpf-all: ∀x∈dom(f). v=f(x) ⇒ P[x; v],
fpf-single: x : v,
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s1;s2],
so_apply: x[s],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
fpf-all: ∀x∈dom(f). v=f(x) ⇒ P[x; v],
fpf-single: x : v,
fpf-ap: f(x),
fpf-dom: x ∈ dom(f),
pi1: fst(t),
pi2: snd(t),
member: t ∈ T,
top: Top,
so_apply: x[s],
prop: ℙ,
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
or: P ∨ Q,
uiff: uiff(P;Q),
uimplies: b supposing a,
assert: ↑b,
ifthenelse: if b then t else f fi ,
bfalse: ff,
rev_implies: P ⇐ Q,
eqof: eqof(d),
so_lambda: λ2x.t[x],
deq: EqDecider(T),
so_apply: x[s1;s2],
subtype_rel: A ⊆r B,
false: False
Latex:
\mforall{}[A:Type]
\mforall{}eq:EqDecider(A)
\mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[P:x:A {}\mrightarrow{} B[x] {}\mrightarrow{} \mBbbP{}].
\mforall{}x:A. \mforall{}v:B[x]. (\mforall{}y\mmember{}dom(x : v). w=x : v(y) {}\mRightarrow{} P[y;w] \mLeftarrow{}{}\mRightarrow{} P[x;v])
Date html generated:
2016_05_16-AM-11_31_32
Last ObjectModification:
2015_12_29-AM-09_36_51
Theory : event-ordering
Home
Index