Nuprl Lemma : minus_wf

[x:ℤ]. (-x ∈ ℤ)


Proof




Definitions occuring in Statement :  uall: [x:A]. B[x] member: t ∈ T minus: -n int:
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut minusEquality hypothesisEquality sqequalHypSubstitution hypothesis sqequalRule axiomEquality equalityTransitivity equalitySymmetry intEquality

Latex:
\mforall{}[x:\mBbbZ{}].  (-x  \mmember{}  \mBbbZ{})



Date html generated: 2016_05_13-PM-03_07_04
Last ObjectModification: 2016_01_06-PM-05_28_34

Theory : core_2


Home Index