Nuprl Lemma : eq-cname_wf

[x,y:Cname].  (eq-cname(x;y) ∈ 𝔹)


Proof




Definitions occuring in Statement :  eq-cname: eq-cname(x;y) coordinate_name: Cname bool: 𝔹 uall: [x:A]. B[x] member: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T eq-cname: eq-cname(x;y) subtype_rel: A ⊆B deq: EqDecider(T)
Lemmas referenced :  cname_deq_wf deq_wf coordinate_name_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut sqequalRule applyEquality lemma_by_obid hypothesis thin lambdaEquality sqequalHypSubstitution setElimination rename hypothesisEquality isectElimination axiomEquality equalityTransitivity equalitySymmetry isect_memberEquality because_Cache

Latex:
\mforall{}[x,y:Cname].    (eq-cname(x;y)  \mmember{}  \mBbbB{})



Date html generated: 2016_05_20-AM-09_28_00
Last ObjectModification: 2015_12_28-PM-04_48_32

Theory : cubical!sets


Home Index