Nuprl - Proof: iter prod zero iff factor zero 1

(13steps total) PrintForm Definitions Lemmas IteratedBinops Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: iter prod zero iff factor zero 1

1. a :

b:

, e:({a..b

}

). (

i:{a..b

}. e(i)) = 0

(Or i:{a..b

}. e(i) = 0)

By:	b:, e:({a..b}). ab (( i:{a..b}. e(i)) = 0 (Or i:{a..b}. e(i) = 0)) Asserted THEN UnivCD

Generated subgoals:

1   b:, e:({a..b}).
  ab  (( i:{a..b}. e(i)) = 0  (Or i:{a..b}. e(i) = 0))
7 steps

2 2. b:, e:({a..b}).
2. ab  (( i:{a..b}. e(i)) = 0  (Or i:{a..b}. e(i) = 0))
3. b :
4. e : {a..b}
  ( i:{a..b}. e(i)) = 0  (Or i:{a..b}. e(i) = 0)
4 steps

About:

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(13steps total) PrintForm Definitions Lemmas IteratedBinops Sections DiscrMathExt Doc