Nuprl Lemma : sq_stable__fpf-sub
∀[A:Type]. ∀[B:A ─→ Type]. ∀[eq:EqDecider(A)]. ∀[f,g:a:A fp-> B[a]]. SqStable(f ⊆ g)
Proof
Definitions occuring in Statement :
fpf-sub: f ⊆ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
sq_stable: SqStable(P),
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ─→ B[x],
universe: Type
Lemmas :
sq_stable__all,
assert_wf,
fpf-dom_wf,
subtype-fpf2,
top_wf,
subtype_top,
fpf-ap_wf,
bool_wf,
eqtt_to_assert,
true_wf,
sq_stable__and,
equal_wf,
sq_stable__assert,
sq_stable__equal,
eqff_to_assert,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
false_wf,
fpf-sub_witness,
squash_wf,
fpf-sub_wf,
fpf_wf,
deq_wf
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> B[a]]. SqStable(f \msubseteq{} g)
Date html generated:
2015_07_17-AM-09_17_14
Last ObjectModification:
2015_01_28-AM-07_51_48
Home
Index