Nuprl Lemma : fpf-sub_witness
∀[A:Type]. ∀[B:A ⟶ Type]. ∀[eq:EqDecider(A)]. ∀[f,g:a:A fp-> B[a]]. (f ⊆ g ⇒ (λx,y. <Ax, Ax> ∈ f ⊆ g))
Proof
Definitions occuring in Statement :
fpf-sub: f ⊆ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
so_apply: x[s],
implies: P ⇒ Q,
member: t ∈ T,
lambda: λx.A[x],
function: x:A ⟶ B[x],
pair: <a, b>,
universe: Type,
axiom: Ax
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
implies: P ⇒ Q,
fpf-sub: f ⊆ g,
all: ∀x:A. B[x],
cand: A c∧ B,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
top: Top,
prop: ℙ,
guard: {T}
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> B[a]]. (f \msubseteq{} g {}\mRightarrow{} (\mlambda{}x,y. <Ax, Ax> \mmember{} f \000C\msubseteq{} g))
Date html generated:
2016_05_16-AM-11_06_19
Last ObjectModification:
2015_12_29-AM-09_14_23
Theory : event-ordering
Home
Index