proof on a set theory problem

Правка en1, от Tornad0, 2016-07-25 17:26:44

Hi all, I have a problem when I want to do conjunction on a union without overflow. My problem is:

(1) let ans = empty

(2) for i from 1 to n do:

How to prove that

?

Теги set theory, proof, overflow, stupid

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Tornad0 2016-07-25 20:10:52 31
en2 Английский Tornad0 2016-07-25 19:44:42 66
en1 Английский Tornad0 2016-07-25 17:26:44 264 Initial revision (published)