Nuprl Lemma : DVp_Pointer-ptr_wf

[v:C_DVALUEp()]. DVp_Pointer-ptr(v) ∈ C_LVALUE()? supposing ↑DVp_Pointer?(v)


Proof




Definitions occuring in Statement :  DVp_Pointer-ptr: DVp_Pointer-ptr(v) DVp_Pointer?: DVp_Pointer?(v) C_DVALUEp: C_DVALUEp() C_LVALUE: C_LVALUE() assert: b uimplies: supposing a uall: [x:A]. B[x] unit: Unit member: t ∈ T union: left right
Definitions unfolded in proof :  uall: [x:A]. B[x] uimplies: supposing a 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) sq_type: SQType(T) guard: {T} eq_atom: =a y ifthenelse: if then else fi  DVp_Pointer?: DVp_Pointer?(v) pi1: fst(t) assert: b bfalse: ff false: False exists: x:A. B[x] prop: or: P ∨ Q bnot: ¬bb DVp_Pointer-ptr: DVp_Pointer-ptr(v) pi2: snd(t)
Lemmas referenced :  C_DVALUEp-ext eq_atom_wf bool_wf eqtt_to_assert assert_of_eq_atom subtype_base_sq atom_subtype_base unit_subtype_base it_wf eqff_to_assert equal_wf bool_cases_sqequal bool_subtype_base assert-bnot neg_assert_of_eq_atom assert_wf DVp_Pointer?_wf C_DVALUEp_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 voidElimination dependent_pairFormation equalityEquality

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



Date html generated: 2016_05_16-AM-08_50_05
Last ObjectModification: 2015_12_28-PM-06_55_41

Theory : C-semantics


Home Index