Theorem bj-ru0 35131

Description: The FOL part of Russell's paradox ru 3715 (see also bj-ru1 35132, bj-ru 35133). Use of elequ1 2113, bj-elequ12 34860 (instead of eleq1 2826, eleq12d 2833 as in ru 3715) permits to remove dependency on ax-10 2137, ax-11 2154, ax-12 2171, ax-ext 2709, df-sb 2068, df-clab 2716, df-cleq 2730, df-clel 2816. (Contributed by BJ, 12-Oct-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-ru0	⊢ ¬ ∀𝑥(𝑥 ∈ 𝑦 ↔ ¬ 𝑥 ∈ 𝑥)

Distinct variable group:   𝑥,𝑦

Proof of Theorem bj-ru0

Step	Hyp	Ref	Expression
1		pm5.19 388	. 2 ⊢ ¬ (𝑦 ∈ 𝑦 ↔ ¬ 𝑦 ∈ 𝑦)
2		elequ1 2113	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑦 ↔ 𝑦 ∈ 𝑦))
3		bj-elequ12 34860	. . . . . 6 ⊢ ((𝑥 = 𝑦 ∧ 𝑥 = 𝑦) → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦))
4	3	anidms 567	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦))
5	4	notbid 318	. . . 4 ⊢ (𝑥 = 𝑦 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ 𝑦 ∈ 𝑦))
6	2, 5	bibi12d 346	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝑦 ↔ ¬ 𝑥 ∈ 𝑥) ↔ (𝑦 ∈ 𝑦 ↔ ¬ 𝑦 ∈ 𝑦)))
7	6	spvv 2000	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝑦 ↔ ¬ 𝑥 ∈ 𝑥) → (𝑦 ∈ 𝑦 ↔ ¬ 𝑦 ∈ 𝑦))
8	1, 7	mto 196	1 ⊢ ¬ ∀𝑥(𝑥 ∈ 𝑦 ↔ ¬ 𝑥 ∈ 𝑥)

Syntax hints:  ¬ wn 3   ↔ wb 205  ∀wal 1537

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783

This theorem is referenced by:  bj-ru1  35132