Nuprl Lemma : fRuleexistsI_wf

[var:ℤ]. (existsI with var ∈ FOLRule())


Proof




Definitions occuring in Statement :  fRuleexistsI: existsI with var FOLRule: FOLRule() uall: [x:A]. B[x] member: t ∈ T int:
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T FOLRule: FOLRule() fRuleexistsI: existsI 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{}].  (existsI  with  var  \mmember{}  FOLRule())



Date html generated: 2020_05_20-AM-09_09_32
Last ObjectModification: 2020_01_24-PM-03_14_31

Theory : minimal-first-order-logic


Home Index