Nuprl Lemma : fpf-cap-subtype_functionality_wrt_sub
∀[A:Type]. ∀[d1,d2,d4:EqDecider(A)]. ∀[f,g:a:A fp-> Type]. ∀[x:A]. {g(x)?Top ⊆r f(x)?Top supposing f ⊆ g}
Proof
Definitions occuring in Statement :
fpf-sub: f ⊆ g,
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uimplies: b supposing a,
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
top: Top,
guard: {T},
universe: Type
Definitions unfolded in proof :
guard: {T},
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
top: Top,
decidable: Dec(P),
or: P ∨ Q,
prop: ℙ,
fpf-cap: f(x)?z,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff,
not: ¬A,
false: False
Latex:
\mforall{}[A:Type]. \mforall{}[d1,d2,d4:EqDecider(A)]. \mforall{}[f,g:a:A fp-> Type]. \mforall{}[x:A].
\{g(x)?Top \msubseteq{}r f(x)?Top supposing f \msubseteq{} g\}
Date html generated:
2016_05_16-AM-11_08_04
Last ObjectModification:
2015_12_29-AM-09_15_58
Theory : event-ordering
Home
Index