| 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 5298 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ {∅}) ∈ V) | |
| 2 | limenpsi.1 | . . . . . . 7 ⊢ Lim 𝐴 | |
| 3 | limsuc 7894 | . . . . . . 7 ⊢ (Lim 𝐴 → (𝑥 ∈ 𝐴 ↔ suc 𝑥 ∈ 𝐴)) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↔ suc 𝑥 ∈ 𝐴) |
| 5 | 4 | biimpi 219 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) |
| 6 | nsuceq0 6474 | . . . . 5 ⊢ suc 𝑥 ≠ ∅ | |
| 7 | eldifsn 4750 | . . . . 5 ⊢ (suc 𝑥 ∈ (𝐴 ∖ {∅}) ↔ (suc 𝑥 ∈ 𝐴 ∧ suc 𝑥 ≠ ∅)) | |
| 8 | 5, 6, 7 | sylanblrc 602 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → suc 𝑥 ∈ (𝐴 ∖ {∅})) |
| 9 | limord 6450 | . . . . . . 7 ⊢ (Lim 𝐴 → Ord 𝐴) | |
| 10 | 2, 9 | ax-mp 5 | . . . . . 6 ⊢ Ord 𝐴 |
| 11 | ordelon 6412 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ On) | |
| 12 | 10, 11 | mpan 703 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ On) |
| 13 | ordelon 6412 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On) | |
| 14 | 10, 13 | mpan 703 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ On) |
| 15 | suc11 6498 | . . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (suc 𝑥 = suc 𝑦 ↔ 𝑥 = 𝑦)) | |
| 16 | 12, 14, 15 | syl2an 608 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (suc 𝑥 = suc 𝑦 ↔ 𝑥 = 𝑦)) |
| 17 | 8, 16 | dom3 9061 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐴 ∖ {∅}) ∈ V) → 𝐴 ≼ (𝐴 ∖ {∅})) |
| 18 | 1, 17 | mpdan 700 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≼ (𝐴 ∖ {∅})) |
| 19 | difss 4075 | . . 3 ⊢ (𝐴 ∖ {∅}) ⊆ 𝐴 | |
| 20 | ssdomg 9065 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∖ {∅}) ⊆ 𝐴 → (𝐴 ∖ {∅}) ≼ 𝐴)) | |
| 21 | 19, 20 | mpi 21 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ {∅}) ≼ 𝐴) |
| 22 | sbth 9154 | . 2 ⊢ ((𝐴 ≼ (𝐴 ∖ {∅}) ∧ (𝐴 ∖ {∅}) ≼ 𝐴) → 𝐴 ≈ (𝐴 ∖ {∅})) | |
| 23 | 18, 21, 22 | syl2anc 596 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≈ (𝐴 ∖ {∅})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 Vcvv 3454 ⊆ wss 3900 ∖ cdif 4048 ∅c0 4281 {csn 4588 class class class wbr 5108 Ord word 6387 Oncon0 6388 Lim wlim 6389 suc csuc 6390 ≈ cen 9008 ≼ cdom 9009 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-en 9012 df-dom 9013 |
| This theorem is used by: limensuci 9210 omenps 9693 infdifsn 9695 ominf4 10429 |
| Copyright terms: Public domain | W3C validator |