Nuprl Lemma : stable-element-predicate_wf

[C:SmallCategory]. ∀[F:Presheaf(C)]. ∀[P:I:cat-ob(C) ⟶ (F I) ⟶ ℙ].
  (stable-element-predicate(C;F;I,rho.P[I;rho]) ∈ ℙ)


Proof




Definitions occuring in Statement :  stable-element-predicate: stable-element-predicate(C;F;I,rho.P[I; rho]) presheaf: Presheaf(C) functor-ob: ob(F) cat-ob: cat-ob(C) small-category: SmallCategory uall: [x:A]. B[x] prop: so_apply: x[s1;s2] member: t ∈ T apply: a function: x:A ⟶ B[x]
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T so_lambda: λ2y.t[x; y] so_apply: x[s1;s2] subtype_rel: A ⊆B presheaf: Presheaf(C) uimplies: supposing a all: x:A. B[x] cat-ob: cat-ob(C) pi1: fst(t) type-cat: TypeCat prop:
Lemmas referenced :  stable-element-predicate_wf1 functor-ob_wf op-cat_wf small-category-subtype type-cat_wf subtype_rel-equal cat-ob_wf cat_ob_op_lemma subtype_rel_self presheaf_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation_alt introduction cut thin instantiate extract_by_obid sqequalHypSubstitution isectElimination hypothesisEquality sqequalRule lambdaEquality_alt applyEquality universeIsType hypothesis independent_isectElimination dependent_functionElimination universeEquality axiomEquality equalityTransitivity equalitySymmetry functionIsType because_Cache isect_memberEquality_alt isectIsTypeImplies inhabitedIsType

Latex:
\mforall{}[C:SmallCategory].  \mforall{}[F:Presheaf(C)].  \mforall{}[P:I:cat-ob(C)  {}\mrightarrow{}  (F  I)  {}\mrightarrow{}  \mBbbP{}].
    (stable-element-predicate(C;F;I,rho.P[I;rho])  \mmember{}  \mBbbP{})



Date html generated: 2020_05_20-AM-07_57_22
Last ObjectModification: 2020_04_03-AM-11_18_51

Theory : small!categories


Home Index