Nuprl Lemma : per-quotient-valueall-type

∀[A:Type]. ∀[E:A ⟶ A ⟶ ℙ].  (valueall-type(a,b:A/per/E[a;b])) supposing (valueall-type(A) and EquivRel(A;a,b.E[a;b]))


Proof




Definitions occuring in Statement :  per-quotient: x,y:T/per/E[x; y],  equiv_rel: EquivRel(T;x,y.E[x; y]),  valueall-type: valueall-type(T),  uimplies: b supposing a,  uall: ∀[x:A]. B[x],  prop: ℙ,  so_apply: x[s1;s2],  function: x:A ⟶ B[x],  universe: Type
Definitions unfolded in proof :  uall: ∀[x:A]. B[x],  member: t ∈ T,  uimplies: b supposing a,  valueall-type: valueall-type(T),  sq_stable: SqStable(P),  implies: P ⇒ Q,  all: ∀x:A. B[x],  has-value: (a)↓,  so_apply: x[s1;s2],  prop: ℙ,  squash: ↓T,  so_lambda: λ2x y.t[x; y],  guard: {T},  uiff: uiff(P;Q),  and: P ∧ Q,  rev_uimplies: rev_uimplies(P;Q),  isect2: T1 ⋂ T2,  bool: 𝔹,  unit: Unit,  it: ⋅,  btrue: tt,  ifthenelse: if b then t else f fi ,  bfalse: ff,  subtype_rel: A ⊆r B
Lemmas referenced :  sq_stable__has-value,  equal_wf,  equal-wf-base,  per-quotient_wf,  base_wf,  valueall-type_wf,  equiv_rel_wf,  isect2_wf,  isect2_subtype_rel,  subtype_rel_functionality_wrt_iff,  per-quotient-isect-base,  ext-eq_weakening,  bool_wf,  has-value_wf_base,  is-exception_wf,  sqle_wf_base
Rules used in proof :  sqequalSubstitution,  sqequalTransitivity,  computationStep,  sqequalReflexivity,  Error :isect_memberFormation_alt,  introduction,  cut,  isect_memberFormation,  extract_by_obid,  sqequalHypSubstitution,  isectElimination,  thin,  sqequalRule,  baseApply,  closedConclusion,  baseClosed,  hypothesisEquality,  hypothesis,  independent_functionElimination,  equalityTransitivity,  equalitySymmetry,  because_Cache,  lambdaFormation,  dependent_functionElimination,  imageMemberEquality,  imageElimination,  lambdaEquality,  applyEquality,  independent_isectElimination,  isect_memberEquality,  axiomSqleEquality,  Error :universeIsType,  Error :functionIsType,  Error :inhabitedIsType,  universeEquality,  functionEquality,  cumulativity,  productElimination,  pointwiseFunctionality,  unionElimination,  equalityElimination,  callbyvalueReduce,  divergentSqle,  sqleReflexivity

Latex:
\mforall{}[A:Type].  \mforall{}[E:A  {}\mrightarrow{}  A  {}\mrightarrow{}  \mBbbP{}].
    (valueall-type(a,b:A/per/E[a;b]))  supposing  (valueall-type(A)  and  EquivRel(A;a,b.E[a;b]))



Date html generated: 2019_06_20-PM-00_33_38
Last ObjectModification: 2018_09_26-PM-01_02_30

Theory : per-quotient


Home Index