Nuprl Lemma : prior-val-induction2
∀[Info,T:Type].
∀es:EO+(Info). ∀X:EClass(T).
∀[P:Id ⟶ T ⟶ ℙ]
((∀e:E(X). (P[loc(e);X(e)] supposing ¬↑e ∈b (X)' ∧ P[loc(e);(X)'(e)] ⇒ P[loc(e);X(e)] supposing ↑e ∈b (X)'))
⇒ (∀e:E(X). P[loc(e);X(e)]))
Proof
Definitions occuring in Statement :
es-prior-val: (X)',
es-E-interface: E(X),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-loc: loc(e),
Id: Id,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s1;s2],
all: ∀x:A. B[x],
not: ¬A,
implies: P ⇒ Q,
and: P ∧ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uimplies: b supposing a,
top: Top,
prop: ℙ,
so_lambda: λ2x.t[x],
and: P ∧ Q,
es-E-interface: E(X),
sq_type: SQType(T),
guard: {T},
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
so_apply: x[s],
decidable: Dec(P),
or: P ∨ Q,
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
int_seg: {i..j-},
lelt: i ≤ j < k,
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
not: ¬A,
le: A ≤ B,
less_than': less_than'(a;b),
nat: ℕ,
ge: i ≥ j ,
less_than: a < b,
squash: ↓T,
Id: Id,
es-locl: (e <loc e')
Latex:
\mforall{}[Info,T:Type].
\mforall{}es:EO+(Info). \mforall{}X:EClass(T).
\mforall{}[P:Id {}\mrightarrow{} T {}\mrightarrow{} \mBbbP{}]
((\mforall{}e:E(X)
(P[loc(e);X(e)] supposing \mneg{}\muparrow{}e \mmember{}\msubb{} (X)'
\mwedge{} P[loc(e);(X)'(e)] {}\mRightarrow{} P[loc(e);X(e)] supposing \muparrow{}e \mmember{}\msubb{} (X)'))
{}\mRightarrow{} (\mforall{}e:E(X). P[loc(e);X(e)]))
Date html generated:
2016_05_17-AM-06_39_10
Last ObjectModification:
2016_01_17-PM-06_35_50
Theory : event-ordering
Home
Index