Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fiprc | GIF version |
Description: The class of finite sets is a proper class. (Contributed by Jeff Hankins, 3-Oct-2008.) |
Ref | Expression |
---|---|
fiprc | ⊢ Fin ∉ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | snnex 4364 | . 2 ⊢ {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∉ V | |
2 | vex 2684 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
3 | snfig 6701 | . . . . . . . . 9 ⊢ (𝑦 ∈ V → {𝑦} ∈ Fin) | |
4 | 2, 3 | ax-mp 5 | . . . . . . . 8 ⊢ {𝑦} ∈ Fin |
5 | eleq1 2200 | . . . . . . . 8 ⊢ (𝑥 = {𝑦} → (𝑥 ∈ Fin ↔ {𝑦} ∈ Fin)) | |
6 | 4, 5 | mpbiri 167 | . . . . . . 7 ⊢ (𝑥 = {𝑦} → 𝑥 ∈ Fin) |
7 | 6 | exlimiv 1577 | . . . . . 6 ⊢ (∃𝑦 𝑥 = {𝑦} → 𝑥 ∈ Fin) |
8 | 7 | abssi 3167 | . . . . 5 ⊢ {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ⊆ Fin |
9 | ssexg 4062 | . . . . 5 ⊢ (({𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ⊆ Fin ∧ Fin ∈ V) → {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∈ V) | |
10 | 8, 9 | mpan 420 | . . . 4 ⊢ (Fin ∈ V → {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∈ V) |
11 | 10 | con3i 621 | . . 3 ⊢ (¬ {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∈ V → ¬ Fin ∈ V) |
12 | df-nel 2402 | . . 3 ⊢ ({𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∉ V ↔ ¬ {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∈ V) | |
13 | df-nel 2402 | . . 3 ⊢ (Fin ∉ V ↔ ¬ Fin ∈ V) | |
14 | 11, 12, 13 | 3imtr4i 200 | . 2 ⊢ ({𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∉ V → Fin ∉ V) |
15 | 1, 14 | ax-mp 5 | 1 ⊢ Fin ∉ V |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 = wceq 1331 ∃wex 1468 ∈ wcel 1480 {cab 2123 ∉ wnel 2401 Vcvv 2681 ⊆ wss 3066 {csn 3522 Fincfn 6627 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-nul 4049 ax-pow 4093 ax-pr 4126 ax-un 4350 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-nel 2402 df-ral 2419 df-rex 2420 df-v 2683 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-nul 3359 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-int 3767 df-br 3925 df-opab 3985 df-id 4210 df-suc 4288 df-iom 4500 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-rn 4545 df-fun 5120 df-fn 5121 df-f 5122 df-f1 5123 df-fo 5124 df-f1o 5125 df-1o 6306 df-en 6628 df-fin 6630 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |