Nuprl Lemma : mFO-dest-atomic_wf

[T:Type]. ∀[F:Atom ⟶ (ℤ List) ⟶ (T?)]. ∀[fmla:mFOL()].  (let nm,vars dest-atomic(fmla) inF[nm;vars] ∈ T?)


Proof




Definitions occuring in Statement :  mFO-dest-atomic: mFO-dest-atomic mFOL: mFOL() list: List uall: [x:A]. B[x] so_apply: x[s1;s2] unit: Unit member: t ∈ T function: x:A ⟶ B[x] union: left right int: atom: Atom universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T mFO-dest-atomic: mFO-dest-atomic all: x:A. B[x] implies:  Q exposed-bfalse: exposed-bfalse bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a ifthenelse: if then else fi  so_apply: x[s1;s2] bfalse: ff exists: x:A. B[x] prop: or: P ∨ Q sq_type: SQType(T) guard: {T} bnot: ¬bb assert: b false: False
Lemmas referenced :  mFOatomic?_wf bool_wf eqtt_to_assert mFOatomic-name_wf mFOatomic-vars_wf eqff_to_assert equal_wf bool_cases_sqequal subtype_base_sq bool_subtype_base assert-bnot it_wf mFOL_wf list_wf unit_wf2
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut extract_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality hypothesis lambdaFormation unionElimination equalityElimination equalityTransitivity equalitySymmetry productElimination independent_isectElimination sqequalRule applyEquality functionExtensionality atomEquality dependent_pairFormation promote_hyp dependent_functionElimination instantiate cumulativity independent_functionElimination because_Cache voidElimination inrEquality axiomEquality isect_memberEquality functionEquality intEquality unionEquality universeEquality

Latex:
\mforall{}[T:Type].  \mforall{}[F:Atom  {}\mrightarrow{}  (\mBbbZ{}  List)  {}\mrightarrow{}  (T?)].  \mforall{}[fmla:mFOL()].
    (let  nm,vars  =  dest-atomic(fmla)  in
      F[nm;vars]  \mmember{}  T?)



Date html generated: 2018_05_21-PM-10_21_41
Last ObjectModification: 2017_07_26-PM-06_37_58

Theory : minimal-first-order-logic


Home Index