Nuprl Lemma : case-type-partition

[Gamma:j⊢]. ∀[phi,psi:{Gamma ⊢ _:𝔽}].
  (∀[A:{Gamma, phi ⊢ _}]. ∀[B:{Gamma, psi ⊢ _}].  Gamma ⊢ (if phi then else B)) supposing 
     (Gamma ⊢ (1(𝔽 (phi ∨ psi)) and 
     Gamma ⊢ ((phi ∧ psi)  0(𝔽)))


Proof




Definitions occuring in Statement :  case-type: (if phi then else B) face-term-implies: Gamma ⊢ (phi  psi) context-subset: Gamma, phi face-or: (a ∨ b) face-and: (a ∧ b) face-1: 1(𝔽) face-0: 0(𝔽) face-type: 𝔽 cubical-term: {X ⊢ _:A} cubical-type: {X ⊢ _} cubical_set: CubicalSet uimplies: supposing a uall: [x:A]. B[x] member: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a subtype_rel: A ⊆B same-cubical-type: Gamma ⊢ B all: x:A. B[x] implies:  Q face-term-implies: Gamma ⊢ (phi  psi) bdd-distributive-lattice: BoundedDistributiveLattice so_lambda: λ2x.t[x] prop: and: P ∧ Q so_apply: x[s] cubical-type-at: A(a) pi1: fst(t) face-type: 𝔽 constant-cubical-type: (X) I_cube: A(I) functor-ob: ob(F) face-presheaf: 𝔽 lattice-point: Point(l) record-select: r.x face_lattice: face_lattice(I) face-lattice: face-lattice(T;eq) free-dist-lattice-with-constraints: free-dist-lattice-with-constraints(T;eq;x.Cs[x]) constrained-antichain-lattice: constrained-antichain-lattice(T;eq;P) mk-bounded-distributive-lattice: mk-bounded-distributive-lattice mk-bounded-lattice: mk-bounded-lattice(T;m;j;z;o) record-update: r[x := v] ifthenelse: if then else fi  eq_atom: =a y bfalse: ff btrue: tt
Lemmas referenced :  case-type_wf same-cubical-type-0 subtype-context-subset-0 context-subset_wf context-subset-subtype face-0_wf face-and_wf lattice-point_wf face_lattice_wf subtype_rel_set bounded-lattice-structure_wf lattice-structure_wf lattice-axioms_wf bounded-lattice-structure-subtype bounded-lattice-axioms_wf equal_wf lattice-meet_wf lattice-join_wf cubical-term-at_wf face-type_wf subtype_rel_self lattice-1_wf I_cube_wf fset_wf nat_wf subset-cubical-type face-or_wf face-1-implies-subset cubical-type_wf face-term-implies_wf face-1_wf istype-cubical-term cubical_set_wf
Rules used in proof :  cut introduction extract_by_obid sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation_alt hypothesis sqequalHypSubstitution isectElimination thin hypothesisEquality independent_isectElimination applyEquality sqequalRule because_Cache lambdaFormation_alt dependent_functionElimination independent_functionElimination equalityIstype universeIsType instantiate lambdaEquality_alt productEquality cumulativity isectEquality setElimination rename inhabitedIsType equalityTransitivity equalitySymmetry

Latex:
\mforall{}[Gamma:j\mvdash{}].  \mforall{}[phi,psi:\{Gamma  \mvdash{}  \_:\mBbbF{}\}].
    (\mforall{}[A:\{Gamma,  phi  \mvdash{}  \_\}].  \mforall{}[B:\{Gamma,  psi  \mvdash{}  \_\}].    Gamma  \mvdash{}  (if  phi  then  A  else  B))  supposing 
          (Gamma  \mvdash{}  (1(\mBbbF{})  {}\mRightarrow{}  (phi  \mvee{}  psi))  and 
          Gamma  \mvdash{}  ((phi  \mwedge{}  psi)  {}\mRightarrow{}  0(\mBbbF{})))



Date html generated: 2020_05_20-PM-03_08_16
Last ObjectModification: 2020_05_11-PM-05_04_58

Theory : cubical!type!theory


Home Index