Theorem rru 3751

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

Originally a subproof in pwnss 5323. (Contributed by Stefan O'Rear, 22-Feb-2015.) Avoid df-nel 3071. (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 2859	. . . . 5 ⊢ ((𝑦 = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∧ 𝑦 = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥}) → (𝑦 ∈ 𝑦 ↔ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥}))
2	1	anidms 576	. . . 4 ⊢ (𝑦 = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} → (𝑦 ∈ 𝑦 ↔ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥}))
3	2	notbid 321	. . 3 ⊢ (𝑦 = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} → (¬ 𝑦 ∈ 𝑦 ↔ ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥}))
4		eleq12 2859	. . . . . 6 ⊢ ((𝑥 = 𝑦 ∧ 𝑥 = 𝑦) → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦))
5	4	anidms 576	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦))
6	5	notbid 321	. . . 4 ⊢ (𝑥 = 𝑦 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ 𝑦 ∈ 𝑦))
7	6	cbvrabv 3433	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} = {𝑦 ∈ 𝐴 ∣ ¬ 𝑦 ∈ 𝑦}
8	3, 7	elrab2 3663	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ↔ ({𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ 𝐴 ∧ ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥}))
9		pclem6 1041	. 2 ⊢ (({𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ↔ ({𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ 𝐴 ∧ ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥})) → ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ 𝐴)
10	8, 9	ax-mp 5	1 ⊢ ¬ {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝑥} ∈ 𝐴

Syntax hints:  ¬ wn 3   ↔ wb 209   ∧ wa 400   = wceq 1567   ∈ wcel 2149  {crab 3423

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465

This theorem is referenced by:  pwnss  5323