Nuprl Lemma : fpf-compatible-single-iff
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:A ⟶ Type]. ∀[f:a:A fp-> B[a]]. ∀[x:A]. ∀[v:B[x]].
uiff(f || x : v;v = f(x) ∈ B[x] supposing ↑x ∈ dom(f))
Proof
Definitions occuring in Statement :
fpf-single: x : v,
fpf-compatible: f || g,
fpf-ap: f(x),
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
deq: EqDecider(T),
assert: ↑b,
uiff: uiff(P;Q),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
member: t ∈ T,
prop: ℙ,
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x],
top: Top,
fpf-compatible: f || g,
implies: P ⇒ Q,
cand: A c∧ B,
rev_uimplies: rev_uimplies(P;Q),
eqof: eqof(d),
sq_type: SQType(T),
guard: {T},
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f:a:A fp-> B[a]]. \mforall{}[x:A]. \mforall{}[v:B[x]].
uiff(f || x : v;v = f(x) supposing \muparrow{}x \mmember{} dom(f))
Date html generated:
2016_05_16-AM-11_29_59
Last ObjectModification:
2015_12_29-AM-09_26_59
Theory : event-ordering
Home
Index