| 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 5302 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ {∅}) ∈ V) | |
| 2 | limenpsi.1 | . . . . . . 7 ⊢ Lim 𝐴 | |
| 3 | limsuc 7851 | . . . . . . 7 ⊢ (Lim 𝐴 → (𝑥 ∈ 𝐴 ↔ suc 𝑥 ∈ 𝐴)) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↔ suc 𝑥 ∈ 𝐴) |
| 5 | 4 | biimpi 219 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) |
| 6 | nsuceq0 6450 | . . . . 5 ⊢ suc 𝑥 ≠ ∅ | |
| 7 | eldifsn 4755 | . . . . 5 ⊢ (suc 𝑥 ∈ (𝐴 ∖ {∅}) ↔ (suc 𝑥 ∈ 𝐴 ∧ suc 𝑥 ≠ ∅)) | |
| 8 | 5, 6, 7 | sylanblrc 602 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → suc 𝑥 ∈ (𝐴 ∖ {∅})) |
| 9 | limord 6426 | . . . . . . 7 ⊢ (Lim 𝐴 → Ord 𝐴) | |
| 10 | 2, 9 | ax-mp 5 | . . . . . 6 ⊢ Ord 𝐴 |
| 11 | ordelon 6388 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ On) | |
| 12 | 10, 11 | mpan 703 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ On) |
| 13 | ordelon 6388 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On) | |
| 14 | 10, 13 | mpan 703 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ On) |
| 15 | suc11 6474 | . . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (suc 𝑥 = suc 𝑦 ↔ 𝑥 = 𝑦)) | |
| 16 | 12, 14, 15 | syl2an 608 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (suc 𝑥 = suc 𝑦 ↔ 𝑥 = 𝑦)) |
| 17 | 8, 16 | dom3 8999 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐴 ∖ {∅}) ∈ V) → 𝐴 ≼ (𝐴 ∖ {∅})) |
| 18 | 1, 17 | mpdan 700 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≼ (𝐴 ∖ {∅})) |
| 19 | difss 4090 | . . 3 ⊢ (𝐴 ∖ {∅}) ⊆ 𝐴 | |
| 20 | ssdomg 9003 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∖ {∅}) ⊆ 𝐴 → (𝐴 ∖ {∅}) ≼ 𝐴)) | |
| 21 | 19, 20 | mpi 21 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ {∅}) ≼ 𝐴) |
| 22 | sbth 9092 | . 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 2146 ≠ wne 2960 Vcvv 3457 ∖ cdif 3903 ⊆ wss 3906 ∅c0 4286 {csn 4591 class class class wbr 5111 Ord word 6363 Oncon0 6364 Lim wlim 6365 suc csuc 6366 ≈ cen 8946 ≼ cdom 8947 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-en 8950 df-dom 8951 |
| This theorem is used by: limensuci 9148 omenps 9631 infdifsn 9633 ominf4 10311 |
| Copyright terms: Public domain | W3C validator |