Nuprl Lemma : LV_Index?_wf

[v:C_LVALUE()]. (LV_Index?(v) ∈ 𝔹)


Proof




Definitions occuring in Statement :  LV_Index?: LV_Index?(v) C_LVALUE: C_LVALUE() bool: 𝔹 uall: [x:A]. B[x] member: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T ext-eq: A ≡ B and: P ∧ Q subtype_rel: A ⊆B all: x:A. B[x] implies:  Q bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) uimplies: supposing a sq_type: SQType(T) guard: {T} eq_atom: =a y ifthenelse: if then else fi  LV_Ground: LV_Ground(loc) LV_Index?: LV_Index?(v) pi1: fst(t) bfalse: ff exists: x:A. B[x] prop: or: P ∨ Q bnot: ¬bb assert: b false: False LV_Index: LV_Index(lval;idx) LV_Scomp: LV_Scomp(lval;comp)
Lemmas referenced :  C_LVALUE-ext eq_atom_wf bool_wf eqtt_to_assert assert_of_eq_atom subtype_base_sq atom_subtype_base bfalse_wf eqff_to_assert equal_wf bool_cases_sqequal bool_subtype_base assert-bnot neg_assert_of_eq_atom btrue_wf C_LVALUE_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation cut lemma_by_obid promote_hyp sqequalHypSubstitution productElimination thin hypothesis_subsumption hypothesis hypothesisEquality applyEquality sqequalRule isectElimination tokenEquality lambdaFormation unionElimination equalityElimination equalityTransitivity equalitySymmetry independent_isectElimination instantiate cumulativity atomEquality dependent_functionElimination independent_functionElimination because_Cache dependent_pairFormation voidElimination equalityEquality

Latex:
\mforall{}[v:C\_LVALUE()].  (LV\_Index?(v)  \mmember{}  \mBbbB{})



Date html generated: 2016_05_16-AM-08_47_10
Last ObjectModification: 2015_12_28-PM-06_57_03

Theory : C-semantics


Home Index