Nuprl Lemma : fpf-cap-join-subtype2

∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[f,g:a:A fp-> Type]. ∀[a:A].  f ⊕ g(a)?Top ⊆r g(a)?Top supposing f || g


Proof




Definitions occuring in Statement :  fpf-join: f ⊕ g,  fpf-compatible: 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,  universe: Type
Definitions unfolded in proof :  uall: ∀[x:A]. B[x],  member: t ∈ T,  uimplies: b supposing a,  subtype_rel: A ⊆r B,  so_lambda: λ2x.t[x],  so_apply: x[s],  all: ∀x:A. B[x],  top: Top,  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,  exists: ∃x:A. B[x],  or: P ∨ Q,  sq_type: SQType(T),  guard: {T},  bnot: ¬bb,  assert: ↑b,  false: False,  not: ¬A
Lemmas referenced :  fpf-join-cap-sq,  subtype-fpf2,  top_wf,  fpf-compatible_wf,  fpf_wf,  deq_wf,  fpf-dom_wf,  bool_wf,  eqtt_to_assert,  subtype_rel-equal,  fpf-ap_wf,  eqff_to_assert,  equal_wf,  bool_cases_sqequal,  subtype_base_sq,  bool_subtype_base,  assert-bnot,  equal-wf-T-base,  assert_wf,  bnot_wf,  not_wf,  subtype_rel_self,  fpf-cap_wf,  uiff_transitivity,  assert_of_bnot
Rules used in proof :  sqequalSubstitution,  sqequalTransitivity,  computationStep,  sqequalReflexivity,  isect_memberFormation,  introduction,  cut,  sqequalRule,  extract_by_obid,  sqequalHypSubstitution,  isectElimination,  thin,  because_Cache,  hypothesisEquality,  applyEquality,  instantiate,  cumulativity,  lambdaEquality,  universeEquality,  hypothesis,  independent_isectElimination,  lambdaFormation,  isect_memberEquality,  voidElimination,  voidEquality,  axiomEquality,  equalityTransitivity,  equalitySymmetry,  unionElimination,  equalityElimination,  productElimination,  dependent_pairFormation,  promote_hyp,  dependent_functionElimination,  independent_functionElimination,  baseClosed

Latex:
\mforall{}[A:Type].  \mforall{}[eq:EqDecider(A)].  \mforall{}[f,g:a:A  fp->  Type].  \mforall{}[a:A].
    f  \moplus{}  g(a)?Top  \msubseteq{}r  g(a)?Top  supposing  f  ||  g



Date html generated: 2018_05_21-PM-09_29_57
Last ObjectModification: 2018_02_09-AM-10_24_36

Theory : finite!partial!functions


Home Index