Nuprl Lemma : C_Struct-fields_wf

[v:C_TYPE()]. C_Struct-fields(v) ∈ (Atom × C_TYPE()) List supposing ↑C_Struct?(v)


Proof




Definitions occuring in Statement :  C_Struct-fields: C_Struct-fields(v) C_Struct?: C_Struct?(v) C_TYPE: C_TYPE() list: List assert: b uimplies: supposing a uall: [x:A]. B[x] member: t ∈ T product: x:A × B[x] atom: Atom
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  C_Struct?: C_Struct?(v) pi1: fst(t) assert: b bfalse: ff false: False exists: x:A. B[x] prop: or: P ∨ Q bnot: ¬bb C_Struct-fields: C_Struct-fields(v) pi2: snd(t)
Lemmas referenced :  C_TYPE-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 C_Struct?_wf C_TYPE_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\_TYPE()].  C\_Struct-fields(v)  \mmember{}  (Atom  \mtimes{}  C\_TYPE())  List  supposing  \muparrow{}C\_Struct?(v)



Date html generated: 2016_05_16-AM-08_44_57
Last ObjectModification: 2015_12_28-PM-06_58_06

Theory : C-semantics


Home Index