Theorem rru 3736

Description: Relative version of Russell's paradox ru 3737 (which corresponds to the case 𝐴 = V).

Originally a subproof in pwnss 5312. (Contributed by Stefan O'Rear, 22-Feb-2015.) Avoid df-nel 3062. (Revised by Steven Nguyen, 23-Nov-2022.) Reduce axiom usage. (Revised by GG, 30-Aug-2024.)

Assertion

Ref	Expression
rru	⊢ ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ 𝐴

Distinct variable group:   𝑥,𝐴

Proof of Theorem rru

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq12 2850	. . . . 5 ⊢ ((𝑦 = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∧ 𝑦 = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥}) → (𝑦 ∈ 𝑦 ↔ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥}))
2	1	anidms 577	. . . 4 ⊢ (𝑦 = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} → (𝑦 ∈ 𝑦 ↔ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥}))
3	2	notbid 321	. . 3 ⊢ (𝑦 = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} → (¬ 𝑦 ∈ 𝑦 ↔ ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥}))
4		eleq12 2850	. . . . . 6 ⊢ ((𝑥 = 𝑦 ∧ 𝑥 = 𝑦) → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦))
5	4	anidms 577	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦))
6	5	notbid 321	. . . 4 ⊢ (𝑥 = 𝑦 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ 𝑦 ∈ 𝑦))
7	6	cbvrabv 3422	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} = {𝑦 ∈ 𝐴 ∣ ¬ 𝑦 ∈ 𝑦}
8	3, 7	elrab2 3648	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ↔ ({𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ 𝐴 ∧ ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥}))
9		pclem6 1043	. 2 ⊢ (({𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ↔ ({𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ 𝐴 ∧ ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥})) → ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ 𝐴)
10	8, 9	ax-mp 5	1 ⊢ ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ 𝐴

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452

This theorem is used by:  pwnss  5312