Nuprl Lemma : mRuleallI_wf

[var:ℤ]. (allI with var ∈ mFOLRule())


Proof




Definitions occuring in Statement :  mRuleallI: allI with var mFOLRule: mFOLRule() uall: [x:A]. B[x] member: t ∈ T int:
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T mFOLRule: mFOLRule() mRuleallI: allI with var eq_atom: =a y ifthenelse: if then else fi  bfalse: ff btrue: tt
Lemmas referenced :  ifthenelse_wf eq_atom_wf unit_wf2 bool_wf nat_wf istype-int
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation_alt cut sqequalRule dependent_pairEquality_alt tokenEquality hypothesisEquality universeIsType thin instantiate introduction extract_by_obid sqequalHypSubstitution isectElimination hypothesis universeEquality intEquality productEquality voidEquality

Latex:
\mforall{}[var:\mBbbZ{}].  (allI  with  var  \mmember{}  mFOLRule())



Date html generated: 2020_05_20-AM-09_08_49
Last ObjectModification: 2020_01_22-PM-05_14_44

Theory : minimal-first-order-logic


Home Index