Nuprl Lemma : pe-e_wf
∀[p:EO ⟶ ℙ']. ∀[e:PossibleEvent(p)]. (pe-e(e) ∈ E)
Proof
Definitions occuring in Statement :
pe-e: pe-e(p),
pe-es: pe-es(e),
possible-event: PossibleEvent(poss),
es-E: E,
event_ordering: EO,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
pe-e: pe-e(p),
pe-es: pe-es(e),
possible-event: PossibleEvent(poss),
uall: ∀[x:A]. B[x],
member: t ∈ T,
pi1: fst(t),
pi2: snd(t),
prop: ℙ,
subtype_rel: A ⊆r B
Latex:
\mforall{}[p:EO {}\mrightarrow{} \mBbbP{}']. \mforall{}[e:PossibleEvent(p)]. (pe-e(e) \mmember{} E)
Date html generated:
2016_05_16-AM-09_52_03
Last ObjectModification:
2015_12_28-PM-09_35_04
Theory : new!event-ordering
Home
Index