Nuprl Lemma : fl-s-fl0

∀[I:fset(ℕ)]. ∀[x:names(I)].  (((x=0))<s> = (x=0) ∈ Point(face_lattice(I+x)))


Proof




Definitions occuring in Statement :  fl-morph: <f>,  fl0: (x=0),  face_lattice: face_lattice(I),  nc-s: s,  add-name: I+i,  names: names(I),  lattice-point: Point(l),  fset: fset(T),  nat: ℕ,  uall: ∀[x:A]. B[x],  apply: f a,  equal: s = t ∈ T
Definitions unfolded in proof :  uall: ∀[x:A]. B[x],  member: t ∈ T,  squash: ↓T,  prop: ℙ,  names: names(I),  subtype_rel: A ⊆r B,  bdd-distributive-lattice: BoundedDistributiveLattice,  so_lambda: λ2x.t[x],  and: P ∧ Q,  so_apply: x[s],  uimplies: b supposing a,  all: ∀x:A. B[x],  true: True,  guard: {T},  iff: P ⇐⇒ Q,  rev_implies: P ⇐ Q,  implies: P ⇒ Q,  nc-s: s,  DeMorgan-algebra: DeMorganAlgebra
Lemmas referenced :  equal_wf,  squash_wf,  true_wf,  lattice-point_wf,  face_lattice_wf,  add-name_wf,  subtype_rel_set,  bounded-lattice-structure_wf,  lattice-structure_wf,  lattice-axioms_wf,  bounded-lattice-structure-subtype,  bounded-lattice-axioms_wf,  uall_wf,  lattice-meet_wf,  lattice-join_wf,  fl-morph-fl0,  nc-s_wf,  f-subset-add-name,  fl0_wf,  names-subtype,  iff_weakening_equal,  names_wf,  fset_wf,  nat_wf,  dM-to-FL-opp,  dM-to-FL_wf,  dM_wf,  DeMorgan-algebra-structure_wf,  DeMorgan-algebra-structure-subtype,  subtype_rel_transitivity,  DeMorgan-algebra-axioms_wf,  neg-dM_inc
Rules used in proof :  sqequalSubstitution,  sqequalTransitivity,  computationStep,  sqequalReflexivity,  isect_memberFormation,  introduction,  cut,  applyEquality,  thin,  lambdaEquality,  sqequalHypSubstitution,  imageElimination,  extract_by_obid,  isectElimination,  hypothesisEquality,  equalityTransitivity,  hypothesis,  equalitySymmetry,  universeEquality,  setElimination,  rename,  sqequalRule,  instantiate,  productEquality,  cumulativity,  because_Cache,  independent_isectElimination,  dependent_functionElimination,  natural_numberEquality,  imageMemberEquality,  baseClosed,  productElimination,  independent_functionElimination,  isect_memberEquality,  axiomEquality

Latex:
\mforall{}[I:fset(\mBbbN{})].  \mforall{}[x:names(I)].    (((x=0))<s>  =  (x=0))



Date html generated: 2017_10_05-AM-01_13_49
Last ObjectModification: 2017_07_28-AM-09_31_12

Theory : cubical!type!theory


Home Index