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
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T fpf-sub: f ⊆ g so_lambda: λ2x.t[x] implies:  Q prop: subtype_rel: A ⊆B so_apply: x[s] uimplies: supposing a all: x:A. B[x] top: Top cand: c∧ B bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) and: P ∧ Q assert: b ifthenelse: if then else fi  bfalse: ff exists: x:A. B[x] or: P ∨ Q sq_type: SQType(T) guard: {T} bnot: ¬bb false: False sq_stable: SqStable(P)
Lemmas referenced :  sq_stable__all assert_wf fpf-dom_wf subtype-fpf2 top_wf equal_wf fpf-ap_wf bool_wf eqtt_to_assert true_wf sq_stable__and 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
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut extract_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality sqequalRule lambdaEquality functionEquality cumulativity applyEquality functionExtensionality hypothesis independent_isectElimination lambdaFormation isect_memberEquality voidElimination voidEquality because_Cache productEquality independent_functionElimination unionElimination equalityElimination equalityTransitivity equalitySymmetry productElimination dependent_pairFormation promote_hyp dependent_functionElimination instantiate universeEquality

Latex:
\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: 2018_05_21-PM-09_18_47
Last ObjectModification: 2018_02_09-AM-10_17_18

Theory : finite!partial!functions


Home Index