Nuprl Lemma : poss-le_wf
∀[poss:EO ⟶ ℙ']. ∀[e1,e2:PossibleEvent(poss)]. (e1 ≤ e2 ∈ ℙ')
Proof
Definitions occuring in Statement :
poss-le: e1 ≤ e2,
possible-event: PossibleEvent(poss),
event_ordering: EO,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
poss-le: e1 ≤ e2,
possible-event: PossibleEvent(poss),
uall: ∀[x:A]. B[x],
member: t ∈ T,
prop: ℙ,
cand: A c∧ B,
pi1: fst(t),
pi2: snd(t),
subtype_rel: A ⊆r B,
uimplies: b supposing a,
squash: ↓T,
true: True,
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x],
top: Top,
guard: {T},
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q
Latex:
\mforall{}[poss:EO {}\mrightarrow{} \mBbbP{}']. \mforall{}[e1,e2:PossibleEvent(poss)]. (e1 \mleq{} e2 \mmember{} \mBbbP{}')
Date html generated:
2016_05_16-AM-09_53_17
Last ObjectModification:
2016_01_17-PM-01_22_55
Theory : new!event-ordering
Home
Index