Nuprl Lemma : fpf-dom_functionality
∀[A:Type]. ∀[B:A ⟶ Type]. ∀[eq1,eq2:EqDecider(A)]. ∀[f:a:A fp-> B[a]]. ∀[x:A]. x ∈ dom(f) = x ∈ dom(f)
Proof
Definitions occuring in Statement :
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
deq: EqDecider(T),
bool: 𝔹,
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
pi1: fst(t),
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
iff: P ⇐⇒ Q,
prop: ℙ,
rev_implies: P ⇐ Q,
true: True,
assert: ↑b,
ifthenelse: if b then t else f fi ,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
false: False,
not: ¬A,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq1,eq2:EqDecider(A)]. \mforall{}[f:a:A fp-> B[a]]. \mforall{}[x:A].
x \mmember{} dom(f) = x \mmember{} dom(f)
Date html generated:
2016_05_16-AM-11_03_55
Last ObjectModification:
2015_12_29-AM-09_12_54
Theory : event-ordering
Home
Index