proof on a set theory problem

→ Pay attention

*has extra registration

→ Top rated

→ Top contributors

View all →

→ Find user

→ Recent actions

Detailed →

proof on a set theory problem

Revision en1, by 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: $\text{[math]}$

How to prove that

$\text{[math]}$ ?

set theory, proof, overflow, stupid

Revisions

Rev.	By	When	Δ	Comment
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)