Nuprl Lemma : sets-id

[C:SmallCategory]. ∀[X:Top].  (cat-id(sets(C; X)) ~ λA.(cat-id(C) (fst(A))))


Proof




Definitions occuring in Statement :  sets: sets(C; X) cat-id: cat-id(C) small-category: SmallCategory uall: [x:A]. B[x] top: Top pi1: fst(t) apply: a lambda: λx.A[x] sqequal: t
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T small-category: SmallCategory spreadn: spread4 sets: sets(C; X) all: x:A. B[x] top: Top presheaf-elements: el(P) mk-cat: mk-cat and: P ∧ Q
Lemmas referenced :  cat_id_tuple_lemma op-cat-id top_wf small-category_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut hypothesisEquality sqequalHypSubstitution setElimination thin rename productElimination sqequalRule extract_by_obid dependent_functionElimination isect_memberEquality voidElimination voidEquality hypothesis equalityTransitivity equalitySymmetry isectElimination sqequalAxiom because_Cache

Latex:
\mforall{}[C:SmallCategory].  \mforall{}[X:Top].    (cat-id(sets(C;  X))  \msim{}  \mlambda{}A.(cat-id(C)  (fst(A))))



Date html generated: 2018_05_22-PM-09_59_15
Last ObjectModification: 2018_05_20-PM-09_42_08

Theory : presheaf!models!of!type!theory


Home Index