Nuprl Lemma : csm-comp-sq

[A,B,C,F,G:Top].  (G G)


Proof




Definitions occuring in Statement :  csm-comp: F cube-cat: CubeCat uall: [x:A]. B[x] top: Top sqequal: t type-cat: TypeCat op-cat: op-cat(C) trans-comp: t1 t2
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T csm-comp: F pscm-comp: F
Lemmas referenced :  pscm-comp-sq cube-cat_wf
Rules used in proof :  cut introduction extract_by_obid sqequalHypSubstitution sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isectElimination thin hypothesis sqequalRule

Latex:
\mforall{}[A,B,C,F,G:Top].    (G  o  F  \msim{}  F  o  G)



Date html generated: 2020_05_20-PM-01_41_32
Last ObjectModification: 2020_04_19-PM-08_13_24

Theory : cubical!type!theory


Home Index