Theorem ru 3004

Description: Russell's Paradox. Proposition 4.14 of [TakeutiZaring] p. 14.

In the late 1800s, Frege's Axiom of (unrestricted) Comprehension, expressed in our notation as A e. _V, asserted that any collection of sets A is a set i.e. belongs to the universe _V of all sets. In particular, by substituting { x | x e/ x } (the "Russell class") for A, it asserted { x | x e/ x } e. _V, meaning that the "collection of all sets which are not members of themselves" is a set. However, here we prove { x | x e/ x } e/ _V. This contradiction was discovered by Russell in 1901 (published in 1903), invalidating the Comprehension Axiom and leading to the collapse of Frege's system.

In 1908, Zermelo rectified this fatal flaw by replacing Comprehension with a weaker Subset (or Separation) Axiom asserting that A is a set only when it is smaller than some other set B. The intuitionistic set theory IZF includes such a separation axiom, Axiom 6 of [Crosilla] p. "Axioms of CZF and IZF", which we include as ax-sep 4178. (Contributed by NM, 7-Aug-1994.)

Assertion

Ref	Expression
ru	|- { x | x e/ x } e/ _V

Proof of Theorem ru

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		pm5.19 708	. . . . . 6 |- -. ( y e. y <-> -. y e. y )
2		eleq1 2270	. . . . . . . 8 |- ( x = y -> ( x e. y <-> y e. y ) )
3		df-nel 2474	. . . . . . . . 9 |- ( x e/ x <-> -. x e. x )
4		id 19	. . . . . . . . . . 11 |- ( x = y -> x = y )
5	4, 4	eleq12d 2278	. . . . . . . . . 10 |- ( x = y -> ( x e. x <-> y e. y ) )
6	5	notbid 669	. . . . . . . . 9 |- ( x = y -> ( -. x e. x <-> -. y e. y ) )
7	3, 6	bitrid 192	. . . . . . . 8 |- ( x = y -> ( x e/ x <-> -. y e. y ) )
8	2, 7	bibi12d 235	. . . . . . 7 |- ( x = y -> ( ( x e. y <-> x e/ x ) <-> ( y e. y <-> -. y e. y ) ) )
9	8	spv 1884	. . . . . 6 |- ( A. x ( x e. y <-> x e/ x ) -> ( y e. y <-> -. y e. y ) )
10	1, 9	mto 664	. . . . 5 |- -. A. x ( x e. y <-> x e/ x )
11		abeq2 2316	. . . . 5 |- ( y = { x | x e/ x } <-> A. x ( x e. y <-> x e/ x ) )
12	10, 11	mtbir 673	. . . 4 |- -. y = { x | x e/ x }
13	12	nex 1524	. . 3 |- -. E. y y = { x | x e/ x }
14		isset 2783	. . 3 |- ( { x | x e/ x } e. _V <-> E. y y = { x | x e/ x } )
15	13, 14	mtbir 673	. 2 |- -. { x | x e/ x } e. _V
16		df-nel 2474	. 2 |- ( { x | x e/ x } e/ _V <-> -. { x | x e/ x } e. _V )
17	15, 16	mpbir 146	1 |- { x | x e/ x } e/ _V

Syntax hints:   -. wn 3   <-> wb 105   A.wal 1371   = wceq 1373   E.wex 1516   e. wcel 2178   {cab 2193   e/ wnel 2473   _Vcvv 2776

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-11 1530  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nel 2474  df-v 2778

This theorem is referenced by: (None)