Nuprl Lemma : DVp_Pointer_wf

[ptr:C_LVALUE()?]. (DVp_Pointer(ptr) ∈ C_DVALUEp())


Proof




Definitions occuring in Statement :  DVp_Pointer: DVp_Pointer(ptr) C_DVALUEp: C_DVALUEp() C_LVALUE: C_LVALUE() uall: [x:A]. B[x] unit: Unit member: t ∈ T union: left right
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T C_DVALUEp: C_DVALUEp() DVp_Pointer: DVp_Pointer(ptr) eq_atom: =a y ifthenelse: if then else fi  bfalse: ff btrue: tt prop: subtype_rel: A ⊆B ext-eq: A ≡ B and: P ∧ Q C_DVALUEpco_size: C_DVALUEpco_size(p) has-value: (a)↓ nat: le: A ≤ B less_than': less_than'(a;b) false: False not: ¬A implies:  Q all: x:A. B[x] so_lambda: λ2x.t[x] so_apply: x[s] uimplies: supposing a
Lemmas referenced :  C_DVALUEpco-ext ifthenelse_wf eq_atom_wf unit_wf2 C_LVALUE_wf int_seg_wf C_DVALUEpco_wf list_wf l_member_wf false_wf le_wf nat_wf has-value_wf_base set_subtype_base int_subtype_base is-exception_wf has-value_wf-partial set-value-type int-value-type C_DVALUEpco_size_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation cut dependent_set_memberEquality lemma_by_obid hypothesis sqequalRule dependent_pairEquality tokenEquality hypothesisEquality thin instantiate sqequalHypSubstitution isectElimination universeEquality intEquality unionEquality productEquality functionEquality atomEquality setEquality voidEquality applyEquality productElimination natural_numberEquality independent_pairFormation lambdaFormation divergentSqle sqleReflexivity lambdaEquality independent_isectElimination because_Cache equalityEquality equalityTransitivity equalitySymmetry dependent_functionElimination independent_functionElimination

Latex:
\mforall{}[ptr:C\_LVALUE()?].  (DVp\_Pointer(ptr)  \mmember{}  C\_DVALUEp())



Date html generated: 2016_05_16-AM-08_49_21
Last ObjectModification: 2015_12_28-PM-06_55_46

Theory : C-semantics


Home Index