Nuprl Lemma : fpf-val-single1
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[x:A]. ∀[v,P:Top]. (z != x : v(x) ==> P[a;z] ~ True ⇒ P[x;v])
Proof
Definitions occuring in Statement :
fpf-single: x : v,
fpf-val: z != f(x) ==> P[a; z],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s1;s2],
implies: P ⇒ Q,
true: True,
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
fpf-single: x : v,
fpf-val: z != f(x) ==> P[a; z],
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
fpf-dom: x ∈ dom(f),
pi1: fst(t),
deq: EqDecider(T),
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uall: ∀[x:A]. B[x],
eqof: eqof(d),
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
bor: p ∨bq,
ifthenelse: if b then t else f fi ,
assert: ↑b,
bfalse: ff,
iff: P ⇐⇒ Q,
not: ¬A,
prop: ℙ,
rev_implies: P ⇐ Q,
false: False
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[x:A]. \mforall{}[v,P:Top]. (z != x : v(x) ==> P[a;z] \msim{} True {}\mRightarrow{} P[x;v])
Date html generated:
2016_05_16-AM-11_17_28
Last ObjectModification:
2015_12_29-AM-09_22_02
Theory : event-ordering
Home
Index