Nuprl Lemma : Q-R-pre-preserving-rewrite-test
∀es:EO
∀[P1,P2:E ⟶ ℙ]. ∀[Q1,R1,Q2,R2:E ⟶ E ⟶ ℙ].
∀f:{e:E| P1 e} ⟶ E
(P2 ⇒ P1 ⇒ Q2 => Q1 ⇒ R1 => R2 ⇒ {f is Q1-R1-pre-preserving on P1 ⇒ f is Q2-R2-pre-preserving on P2})
Proof
Definitions occuring in Statement :
Q-R-pre-preserving: f is Q-R-pre-preserving on P,
es-E: E,
event_ordering: EO,
predicate_implies: P1 ⇒ P2,
rel_implies: R1 => R2,
uall: ∀[x:A]. B[x],
prop: ℙ,
guard: {T},
all: ∀x:A. B[x],
implies: P ⇒ Q,
set: {x:A| B[x]} ,
apply: f a,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
subtype_rel: A ⊆r B,
guard: {T},
so_lambda: λ2x.t[x],
so_apply: x[s],
exists: ∃x:A. B[x],
uimplies: b supposing a,
rev_implies: P ⇐ Q,
predicate_rev_implies: P1 ⇐ P2,
rel_rev_implies: R1 ⇐ R2,
predicate_implies: P1 ⇒ P2,
label: ...$L... t,
rel_implies: R1 => R2
Latex:
\mforall{}es:EO
\mforall{}[P1,P2:E {}\mrightarrow{} \mBbbP{}]. \mforall{}[Q1,R1,Q2,R2:E {}\mrightarrow{} E {}\mrightarrow{} \mBbbP{}].
\mforall{}f:\{e:E| P1 e\} {}\mrightarrow{} E
(P2 {}\mRightarrow{} P1
{}\mRightarrow{} Q2 => Q1
{}\mRightarrow{} R1 => R2
{}\mRightarrow{} \{f is Q1-R1-pre-preserving on P1 {}\mRightarrow{} f is Q2-R2-pre-preserving on P2\})
Date html generated:
2016_05_16-AM-10_18_52
Last ObjectModification:
2015_12_28-PM-09_28_00
Theory : new!event-ordering
Home
Index