Nuprl Lemma : empty-context-subset-lemma3
∀[Gamma:j⊢]. ∀[A,x,y:Top].  (x = y ∈ {Gamma, 0(𝔽) ⊢ _:A})
Proof
Definitions occuring in Statement : 
context-subset: Gamma, phi
, 
face-0: 0(𝔽)
, 
cubical-term: {X ⊢ _:A}
, 
cubical_set: CubicalSet
, 
uall: ∀[x:A]. B[x]
, 
top: Top
, 
equal: s = t ∈ T
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
cubical-term: {X ⊢ _:A}
, 
context-subset: Gamma, phi
, 
all: ∀x:A. B[x]
, 
member: t ∈ T
, 
face-0: 0(𝔽)
, 
cubical-term-at: u(a)
, 
not: ¬A
, 
implies: P 
⇒ Q
, 
false: False
Lemmas referenced : 
I_cube_pair_redex_lemma, 
face-lattice-0-not-1, 
I_cube_wf, 
context-subset_wf, 
face-0_wf, 
fset_wf, 
nat_wf, 
names-hom_wf, 
istype-top, 
cubical_set_wf, 
istype-cubical-type-at, 
cube-set-restriction_wf, 
cubical-type-ap-morph_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation_alt, 
cut, 
dependent_set_memberEquality_alt, 
functionExtensionality, 
sqequalHypSubstitution, 
introduction, 
extract_by_obid, 
dependent_functionElimination, 
thin, 
Error :memTop, 
hypothesis, 
setElimination, 
rename, 
sqequalRule, 
isectElimination, 
hypothesisEquality, 
independent_functionElimination, 
voidElimination, 
lambdaFormation_alt, 
because_Cache, 
universeIsType, 
inhabitedIsType, 
instantiate, 
functionIsType, 
equalityIstype, 
applyEquality
Latex:
\mforall{}[Gamma:j\mvdash{}].  \mforall{}[A,x,y:Top].    (x  =  y)
Date html generated:
2020_05_20-PM-04_12_58
Last ObjectModification:
2020_04_10-AM-04_38_48
Theory : cubical!type!theory
Home
Index