Nuprl Lemma : FOConnective+_wf

∀[vsa,vsb:ℤ List].
  ∀knd:Atom
    (FOConnective+(knd) ∈ AbstractFOFormula+(vsa)
     ⟶ AbstractFOFormula+(vsb)
     ⟶ AbstractFOFormula+(val-union(IntDeq;vsa;vsb)))


Proof




Definitions occuring in Statement :  FOConnective+: FOConnective+(knd),  AbstractFOFormula+: AbstractFOFormula+(vs),  val-union: val-union(eq;as;bs),  list: T List,  int-deq: IntDeq,  uall: ∀[x:A]. B[x],  all: ∀x:A. B[x],  member: t ∈ T,  function: x:A ⟶ B[x],  int: ℤ,  atom: Atom
Definitions unfolded in proof :  uall: ∀[x:A]. B[x],  member: t ∈ T,  all: ∀x:A. B[x],  FOConnective+: FOConnective+(knd),  AbstractFOFormula+: AbstractFOFormula+(vs),  subtype_rel: A ⊆r B,  and: P ∧ Q,  uimplies: b supposing a,  prop: ℙ,  implies: P ⇒ Q,  FOStruct+: FOStruct+{i:l}(Dom),  FOStruct: FOStruct(Dom),  so_lambda: λ2x.t[x],  or: P ∨ Q,  so_apply: x[s],  cand: A c∧ B
Lemmas referenced :  subtype_rel_FOAssignment,  val-union_wf,  FOSatWith+_wf,  nil_wf,  let_wf,  ifthenelse_wf,  eq_atom_wf,  b-union_wf,  or_wf,  equal_wf,  FOAssignment_wf,  int-deq_wf,  int-valueall-type,  FOStruct+_wf,  AbstractFOFormula+_wf,  list_wf,  union-contains,  union-contains2,  val-union-l-union
Rules used in proof :  sqequalSubstitution,  sqequalTransitivity,  computationStep,  sqequalReflexivity,  isect_memberFormation,  introduction,  cut,  lambdaFormation,  lambdaEquality,  hypothesisEquality,  applyEquality,  sqequalHypSubstitution,  productElimination,  thin,  extract_by_obid,  isectElimination,  because_Cache,  independent_isectElimination,  hypothesis,  sqequalRule,  cumulativity,  universeEquality,  setElimination,  rename,  tokenEquality,  instantiate,  productEquality,  functionEquality,  equalityTransitivity,  equalitySymmetry,  dependent_functionElimination,  independent_functionElimination,  intEquality,  atomEquality,  axiomEquality,  isect_memberEquality,  independent_pairFormation

Latex:
\mforall{}[vsa,vsb:\mBbbZ{}  List].
    \mforall{}knd:Atom
        (FOConnective+(knd)  \mmember{}  AbstractFOFormula+(vsa)
          {}\mrightarrow{}  AbstractFOFormula+(vsb)
          {}\mrightarrow{}  AbstractFOFormula+(val-union(IntDeq;vsa;vsb)))



Date html generated: 2018_05_21-PM-10_20_36
Last ObjectModification: 2017_07_26-PM-06_37_32

Theory : minimal-first-order-logic


Home Index