Nuprl Lemma : primed-class-prior-val
∀[Info,T:Type]. ∀[X:EClass(T)]. Prior(X) = (X)' ∈ EClass(T) supposing Singlevalued(X)
Proof
Definitions occuring in Statement :
es-prior-val: (X)',
primed-class: Prior(X),
sv-class: Singlevalued(X),
eclass: EClass(A[eo; e]),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
eclass: EClass(A[eo; e]),
subtype_rel: A ⊆r B,
prop: ℙ,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
es-prior-val: (X)',
primed-class: Prior(X),
es-prior-interface: prior(X),
local-pred-class: local-pred-class(P),
in-eclass: e ∈b X,
eclass-val: X(e),
nat: ℕ,
so_lambda: λ2x.t[x],
and: P ∧ Q,
sv-class: Singlevalued(X),
le: A ≤ B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
so_apply: x[s],
or: P ∨ Q,
top: Top,
eq_int: (i =z j),
ifthenelse: if b then t else f fi ,
btrue: tt,
bfalse: ff,
sq_exists: ∃x:{A| B[x]},
es-locl: (e <loc e'),
uiff: uiff(P;Q),
not: ¬A,
rev_uimplies: rev_uimplies(P;Q),
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
iff: P ⇐⇒ Q,
true: True,
guard: {T},
squash: ↓T,
rev_implies: P ⇐ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
lt_int: i <z j,
cand: A c∧ B,
sq_stable: SqStable(P),
nequal: a ≠ b ∈ T
Latex:
\mforall{}[Info,T:Type]. \mforall{}[X:EClass(T)]. Prior(X) = (X)' supposing Singlevalued(X)
Date html generated:
2016_05_16-PM-11_59_43
Last ObjectModification:
2016_01_17-PM-07_02_31
Theory : event-ordering
Home
Index