Nuprl Lemma : MMTree_Node-forest_wf

[T:Type]. ∀[v:MMTree(T)].  MMTree_Node-forest(v) ∈ MMTree(T) List List supposing ↑MMTree_Node?(v)


Proof




Definitions occuring in Statement :  MMTree_Node-forest: MMTree_Node-forest(v) MMTree_Node?: MMTree_Node?(v) MMTree: MMTree(T) list: List assert: b uimplies: supposing a uall: [x:A]. B[x] member: t ∈ T universe: Type
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  MMTree_Node?: MMTree_Node?(v) pi1: fst(t) assert: b bfalse: ff false: False exists: x:A. B[x] prop: or: P ∨ Q bnot: ¬bb MMTree_Node-forest: MMTree_Node-forest(v) pi2: snd(t)
Lemmas referenced :  MMTree-ext eq_atom_wf bool_wf eqtt_to_assert assert_of_eq_atom subtype_base_sq atom_subtype_base eqff_to_assert equal_wf bool_cases_sqequal bool_subtype_base assert-bnot neg_assert_of_eq_atom assert_wf MMTree_Node?_wf MMTree_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation cut lemma_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality promote_hyp productElimination hypothesis_subsumption hypothesis applyEquality sqequalRule tokenEquality lambdaFormation unionElimination equalityElimination equalityTransitivity equalitySymmetry independent_isectElimination instantiate cumulativity atomEquality dependent_functionElimination independent_functionElimination because_Cache voidElimination dependent_pairFormation equalityEquality universeEquality

Latex:
\mforall{}[T:Type].  \mforall{}[v:MMTree(T)].    MMTree\_Node-forest(v)  \mmember{}  MMTree(T)  List  List  supposing  \muparrow{}MMTree\_Node?(v)



Date html generated: 2016_05_16-AM-08_55_29
Last ObjectModification: 2015_12_28-PM-06_52_50

Theory : C-semantics


Home Index