Nuprl Lemma : mRuleandI_wf

andI ∈ mFOLRule()


Proof




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

Latex:
andI  \mmember{}  mFOLRule()



Date html generated: 2020_05_20-AM-09_08_43
Last ObjectModification: 2020_01_22-PM-06_54_20

Theory : minimal-first-order-logic


Home Index