Nuprl Lemma : cubical-fiber_wf

[X:j⊢]. ∀[T,A:{X ⊢ _}]. ∀[w:{X ⊢ _:(T ⟶ A)}]. ∀[a:{X ⊢ _:A}].  X ⊢ Fiber(w;a)


Proof




Definitions occuring in Statement :  cubical-fiber: Fiber(w;a) cubical-fun: (A ⟶ B) cubical-term: {X ⊢ _:A} cubical-type: {X ⊢ _} cubical_set: CubicalSet uall: [x:A]. B[x] member: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T cubical-fiber: Fiber(w;a) subtype_rel: A ⊆B all: x:A. B[x] and: P ∧ Q
Lemmas referenced :  cubical-sigma_wf path-type_wf cube-context-adjoin_wf cubical_set_cumulativity-i-j cubical-type-cumulativity2 csm-ap-type_wf cc-fst_wf csm-ap-term_wf cubical-term_wf cubical-fun_wf cubical-type_wf cubical_set_wf cc-snd_wf csm-cubical-fun cubical-app_wf_fun
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation_alt introduction cut sqequalRule extract_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality instantiate applyEquality hypothesis because_Cache equalityTransitivity equalitySymmetry axiomEquality universeIsType isect_memberEquality_alt isectIsTypeImplies inhabitedIsType dependent_functionElimination dependent_set_memberEquality_alt independent_pairFormation productIsType equalityIstype applyLambdaEquality setElimination rename productElimination lambdaEquality_alt hyp_replacement

Latex:
\mforall{}[X:j\mvdash{}].  \mforall{}[T,A:\{X  \mvdash{}  \_\}].  \mforall{}[w:\{X  \mvdash{}  \_:(T  {}\mrightarrow{}  A)\}].  \mforall{}[a:\{X  \mvdash{}  \_:A\}].    X  \mvdash{}  Fiber(w;a)



Date html generated: 2020_05_20-PM-03_23_42
Last ObjectModification: 2020_04_07-PM-03_34_58

Theory : cubical!type!theory


Home Index