Nuprl Lemma : DVp_Pointer?_wf

[v:C_DVALUEp()]. (DVp_Pointer?(v) ∈ 𝔹)


Proof




Definitions occuring in Statement :  DVp_Pointer?: DVp_Pointer?(v) C_DVALUEp: C_DVALUEp() 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  DVp_Null: DVp_Null(x) DVp_Pointer?: DVp_Pointer?(v) pi1: fst(t) bfalse: ff exists: x:A. B[x] prop: or: P ∨ Q bnot: ¬bb assert: b false: False DVp_Int: DVp_Int(int) DVp_Pointer: DVp_Pointer(ptr) DVp_Array: DVp_Array(lower;upper;arr) DVp_Struct: DVp_Struct(lbls;struct)
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 bfalse_wf eqff_to_assert equal_wf bool_cases_sqequal bool_subtype_base assert-bnot neg_assert_of_eq_atom btrue_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 dependent_pairFormation voidElimination equalityEquality

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



Date html generated: 2016_05_16-AM-08_50_00
Last ObjectModification: 2015_12_28-PM-06_55_38

Theory : C-semantics


Home Index