Nuprl Lemma : itermMinus_wf
∀[num:int_term()]. ("-"num ∈ int_term())
Proof
Definitions occuring in Statement : 
itermMinus: "-"num
, 
int_term: int_term()
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
int_term: int_term()
, 
itermMinus: "-"num
, 
subtype_rel: A ⊆r B
, 
eq_atom: x =a y
, 
ifthenelse: if b then t else f fi 
, 
bfalse: ff
, 
btrue: tt
, 
ext-eq: A ≡ B
, 
and: P ∧ Q
, 
int_termco_size: int_termco_size(p)
, 
int_term_size: int_term_size(p)
, 
nat: ℕ
, 
le: A ≤ B
, 
less_than': less_than'(a;b)
, 
false: False
, 
not: ¬A
, 
implies: P 
⇒ Q
, 
prop: ℙ
, 
all: ∀x:A. B[x]
, 
uimplies: b supposing a
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
Lemmas referenced : 
int_termco-ext, 
int_term_wf, 
ifthenelse_wf, 
eq_atom_wf, 
int_termco_wf, 
add_nat_wf, 
istype-void, 
le_wf, 
int_term_size_wf, 
value-type-has-value, 
nat_wf, 
set-value-type, 
istype-int, 
int-value-type, 
has-value_wf-partial, 
int_termco_size_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
Error :isect_memberFormation_alt, 
cut, 
Error :dependent_set_memberEquality_alt, 
introduction, 
extract_by_obid, 
hypothesis, 
sqequalRule, 
Error :dependent_pairEquality_alt, 
tokenEquality, 
hypothesisEquality, 
applyEquality, 
thin, 
Error :lambdaEquality_alt, 
sqequalHypSubstitution, 
setElimination, 
rename, 
Error :universeIsType, 
instantiate, 
isectElimination, 
universeEquality, 
intEquality, 
productEquality, 
voidEquality, 
productElimination, 
natural_numberEquality, 
independent_pairFormation, 
Error :lambdaFormation_alt, 
Error :inhabitedIsType, 
independent_isectElimination, 
Error :equalityIsType1, 
equalityTransitivity, 
equalitySymmetry, 
dependent_functionElimination, 
independent_functionElimination
Latex:
\mforall{}[num:int\_term()].  ("-"num  \mmember{}  int\_term())
Date html generated:
2019_06_20-PM-00_45_00
Last ObjectModification:
2018_10_03-AM-00_45_39
Theory : omega
Home
Index