![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > limenpsi | Structured version Visualization version GIF version |
Description: A limit ordinal is equinumerous to a proper subset of itself. (Contributed by NM, 30-Oct-2003.) (Revised by Mario Carneiro, 16-Nov-2014.) |
Ref | Expression |
---|---|
limenpsi.1 | ⊢ Lim 𝐴 |
Ref | Expression |
---|---|
limenpsi | ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≈ (𝐴 ∖ {∅})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | difexg 5326 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ {∅}) ∈ V) | |
2 | limenpsi.1 | . . . . . . 7 ⊢ Lim 𝐴 | |
3 | limsuc 7834 | . . . . . . 7 ⊢ (Lim 𝐴 → (𝑥 ∈ 𝐴 ↔ suc 𝑥 ∈ 𝐴)) | |
4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↔ suc 𝑥 ∈ 𝐴) |
5 | 4 | biimpi 215 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) |
6 | nsuceq0 6444 | . . . . 5 ⊢ suc 𝑥 ≠ ∅ | |
7 | eldifsn 4789 | . . . . 5 ⊢ (suc 𝑥 ∈ (𝐴 ∖ {∅}) ↔ (suc 𝑥 ∈ 𝐴 ∧ suc 𝑥 ≠ ∅)) | |
8 | 5, 6, 7 | sylanblrc 590 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → suc 𝑥 ∈ (𝐴 ∖ {∅})) |
9 | limord 6421 | . . . . . . 7 ⊢ (Lim 𝐴 → Ord 𝐴) | |
10 | 2, 9 | ax-mp 5 | . . . . . 6 ⊢ Ord 𝐴 |
11 | ordelon 6385 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ On) | |
12 | 10, 11 | mpan 688 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ On) |
13 | ordelon 6385 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On) | |
14 | 10, 13 | mpan 688 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ On) |
15 | suc11 6468 | . . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (suc 𝑥 = suc 𝑦 ↔ 𝑥 = 𝑦)) | |
16 | 12, 14, 15 | syl2an 596 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (suc 𝑥 = suc 𝑦 ↔ 𝑥 = 𝑦)) |
17 | 8, 16 | dom3 8988 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐴 ∖ {∅}) ∈ V) → 𝐴 ≼ (𝐴 ∖ {∅})) |
18 | 1, 17 | mpdan 685 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≼ (𝐴 ∖ {∅})) |
19 | difss 4130 | . . 3 ⊢ (𝐴 ∖ {∅}) ⊆ 𝐴 | |
20 | ssdomg 8992 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∖ {∅}) ⊆ 𝐴 → (𝐴 ∖ {∅}) ≼ 𝐴)) | |
21 | 19, 20 | mpi 20 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ {∅}) ≼ 𝐴) |
22 | sbth 9089 | . 2 ⊢ ((𝐴 ≼ (𝐴 ∖ {∅}) ∧ (𝐴 ∖ {∅}) ≼ 𝐴) → 𝐴 ≈ (𝐴 ∖ {∅})) | |
23 | 18, 21, 22 | syl2anc 584 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≈ (𝐴 ∖ {∅})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 Vcvv 3474 ∖ cdif 3944 ⊆ wss 3947 ∅c0 4321 {csn 4627 class class class wbr 5147 Ord word 6360 Oncon0 6361 Lim wlim 6362 suc csuc 6363 ≈ cen 8932 ≼ cdom 8933 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-en 8936 df-dom 8937 |
This theorem is referenced by: limensuci 9149 omenps 9646 infdifsn 9648 ominf4 10303 |
Copyright terms: Public domain | W3C validator |