![]() |
Mathbox for BJ |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > curryset | Structured version Visualization version GIF version |
Description: Curry's paradox in set theory. This can be seen as a generalization of Russell's paradox, which corresponds to the case where 𝜑 is ⊥. See alternate exposal of basically the same proof currysetALT 36287. (Contributed by BJ, 23-Sep-2023.) This proof is intuitionistically valid. (Proof modification is discouraged.) |
Ref | Expression |
---|---|
curryset | ⊢ ¬ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ 𝑉 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | currysetlem 36282 | . . . . . 6 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} → ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ↔ ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} → 𝜑))) | |
2 | 1 | ibi 267 | . . . . 5 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} → ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} → 𝜑)) |
3 | 2 | pm2.43i 52 | . . . 4 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} → 𝜑) |
4 | currysetlem 36282 | . . . 4 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ 𝑉 → ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ↔ ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} → 𝜑))) | |
5 | 3, 4 | mpbiri 258 | . . 3 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ 𝑉 → {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)}) |
6 | ax-1 6 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑥 → 𝜑)) | |
7 | 6 | alrimiv 1922 | . . . 4 ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝑥 → 𝜑)) |
8 | bj-abv 36242 | . . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝑥 → 𝜑) → {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} = V) | |
9 | 7, 8 | syl 17 | . . 3 ⊢ (𝜑 → {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} = V) |
10 | nvel 5306 | . . . 4 ⊢ ¬ V ∈ 𝑉 | |
11 | eleq1 2813 | . . . 4 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} = V → ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ 𝑉 ↔ V ∈ 𝑉)) | |
12 | 10, 11 | mtbiri 327 | . . 3 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} = V → ¬ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ 𝑉) |
13 | 5, 3, 9, 12 | 4syl 19 | . 2 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ 𝑉 → ¬ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ 𝑉) |
14 | 13 | bj-pm2.01i 35895 | 1 ⊢ ¬ {𝑥 ∣ (𝑥 ∈ 𝑥 → 𝜑)} ∈ 𝑉 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1531 = wceq 1533 ∈ wcel 2098 {cab 2701 Vcvv 3466 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-tru 1536 df-ex 1774 df-nf 1778 df-sb 2060 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-v 3468 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |