Nuprl Lemma : weak-antecedent-functions-compose
∀es:EO
∀[P,Q,R:E ⟶ ℙ].
∀f:{e:E| P e} ⟶ {e:E| Q e} . ∀g:{e:E| Q e} ⟶ {e:E| R e} . ((Q ←==f== P ∧ R ←==g== Q) ⇒ R ←==g o f== P)
Proof
Definitions occuring in Statement :
weak-antecedent-function: Q ←==f== P,
es-E: E,
event_ordering: EO,
compose: f o g,
uall: ∀[x:A]. B[x],
prop: ℙ,
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: 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,
and: P ∧ Q,
weak-antecedent-function: Q ←==f== P,
member: t ∈ T,
prop: ℙ,
so_lambda: λ2x.t[x],
subtype_rel: A ⊆r B,
so_apply: x[s],
uimplies: b supposing a,
compose: f o g,
cand: A c∧ B,
guard: {T}
Latex:
\mforall{}es:EO
\mforall{}[P,Q,R:E {}\mrightarrow{} \mBbbP{}].
\mforall{}f:\{e:E| P e\} {}\mrightarrow{} \{e:E| Q e\} . \mforall{}g:\{e:E| Q e\} {}\mrightarrow{} \{e:E| R e\} .
((Q \mleftarrow{}==f== P \mwedge{} R \mleftarrow{}==g== Q) {}\mRightarrow{} R \mleftarrow{}==g o f== P)
Date html generated:
2016_05_16-AM-10_16_18
Last ObjectModification:
2015_12_28-PM-09_23_25
Theory : new!event-ordering
Home
Index