| 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 5300 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ {∅}) ∈ V) | |
| 2 | limenpsi.1 | . . . . . . 7 ⊢ Lim 𝐴 | |
| 3 | limsuc 7844 | . . . . . . 7 ⊢ (Lim 𝐴 → (𝑥 ∈ 𝐴 ↔ suc 𝑥 ∈ 𝐴)) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↔ suc 𝑥 ∈ 𝐴) |
| 5 | 4 | biimpi 219 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) |
| 6 | nsuceq0 6447 | . . . . 5 ⊢ suc 𝑥 ≠ ∅ | |
| 7 | eldifsn 4758 | . . . . 5 ⊢ (suc 𝑥 ∈ (𝐴 ∖ {∅}) ↔ (suc 𝑥 ∈ 𝐴 ∧ suc 𝑥 ≠ ∅)) | |
| 8 | 5, 6, 7 | sylanblrc 601 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → suc 𝑥 ∈ (𝐴 ∖ {∅})) |
| 9 | limord 6423 | . . . . . . 7 ⊢ (Lim 𝐴 → Ord 𝐴) | |
| 10 | 2, 9 | ax-mp 5 | . . . . . 6 ⊢ Ord 𝐴 |
| 11 | ordelon 6385 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ On) | |
| 12 | 10, 11 | mpan 702 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ On) |
| 13 | ordelon 6385 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On) | |
| 14 | 10, 13 | mpan 702 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ On) |
| 15 | suc11 6471 | . . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (suc 𝑥 = suc 𝑦 ↔ 𝑥 = 𝑦)) | |
| 16 | 12, 14, 15 | syl2an 607 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (suc 𝑥 = suc 𝑦 ↔ 𝑥 = 𝑦)) |
| 17 | 8, 16 | dom3 8992 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐴 ∖ {∅}) ∈ V) → 𝐴 ≼ (𝐴 ∖ {∅})) |
| 18 | 1, 17 | mpdan 699 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≼ (𝐴 ∖ {∅})) |
| 19 | difss 4098 | . . 3 ⊢ (𝐴 ∖ {∅}) ⊆ 𝐴 | |
| 20 | ssdomg 8996 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∖ {∅}) ⊆ 𝐴 → (𝐴 ∖ {∅}) ≼ 𝐴)) | |
| 21 | 19, 20 | mpi 21 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ {∅}) ≼ 𝐴) |
| 22 | sbth 9084 | . 2 ⊢ ((𝐴 ≼ (𝐴 ∖ {∅}) ∧ (𝐴 ∖ {∅}) ≼ 𝐴) → 𝐴 ≈ (𝐴 ∖ {∅})) | |
| 23 | 18, 21, 22 | syl2anc 595 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≈ (𝐴 ∖ {∅})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 Vcvv 3463 ∖ cdif 3910 ⊆ wss 3913 ∅c0 4294 {csn 4594 class class class wbr 5113 Ord word 6360 Oncon0 6361 Lim wlim 6362 suc csuc 6363 ≈ cen 8939 ≼ cdom 8940 |
| 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-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-en 8943 df-dom 8944 |
| This theorem is referenced by: limensuci 9140 omenps 9623 infdifsn 9625 ominf4 10295 |
| Copyright terms: Public domain | W3C validator |