| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ominf | Structured version Visualization version GIF version | ||
| Description: The set of natural numbers is infinite. Corollary 6D(b) of [Enderton] p. 136. (Contributed by NM, 2-Jun-1998.) Avoid ax-pow 5334. (Revised by BTernaryTau, 2-Jan-2025.) |
| Ref | Expression |
|---|---|
| ominf | ⊢ ¬ ω ∈ Fin |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isfi 9040 | . . 3 ⊢ (ω ∈ Fin ↔ ∃𝑥 ∈ ω ω ≈ 𝑥) | |
| 2 | nnord 7919 | . . . . . . . 8 ⊢ (𝑥 ∈ ω → Ord 𝑥) | |
| 3 | ordom 7921 | . . . . . . . 8 ⊢ Ord ω | |
| 4 | ordelssne 6415 | . . . . . . . 8 ⊢ ((Ord 𝑥 ∧ Ord ω) → (𝑥 ∈ ω ↔ (𝑥 ⊆ ω ∧ 𝑥 ≠ ω))) | |
| 5 | 2, 3, 4 | sylancl 598 | . . . . . . 7 ⊢ (𝑥 ∈ ω → (𝑥 ∈ ω ↔ (𝑥 ⊆ ω ∧ 𝑥 ≠ ω))) |
| 6 | 5 | ibi 270 | . . . . . 6 ⊢ (𝑥 ∈ ω → (𝑥 ⊆ ω ∧ 𝑥 ≠ ω)) |
| 7 | df-pss 4017 | . . . . . 6 ⊢ (𝑥 ⊊ ω ↔ (𝑥 ⊆ ω ∧ 𝑥 ≠ ω)) | |
| 8 | 6, 7 | sylibr 237 | . . . . 5 ⊢ (𝑥 ∈ ω → 𝑥 ⊊ ω) |
| 9 | nnfi 9221 | . . . . . . 7 ⊢ (𝑥 ∈ ω → 𝑥 ∈ Fin) | |
| 10 | ensymfib 9237 | . . . . . . 7 ⊢ (𝑥 ∈ Fin → (𝑥 ≈ ω ↔ ω ≈ 𝑥)) | |
| 11 | 9, 10 | syl 18 | . . . . . 6 ⊢ (𝑥 ∈ ω → (𝑥 ≈ ω ↔ ω ≈ 𝑥)) |
| 12 | 11 | biimpar 483 | . . . . 5 ⊢ ((𝑥 ∈ ω ∧ ω ≈ 𝑥) → 𝑥 ≈ ω) |
| 13 | pssinf 9291 | . . . . 5 ⊢ ((𝑥 ⊊ ω ∧ 𝑥 ≈ ω) → ¬ ω ∈ Fin) | |
| 14 | 8, 12, 13 | syl2an2r 698 | . . . 4 ⊢ ((𝑥 ∈ ω ∧ ω ≈ 𝑥) → ¬ ω ∈ Fin) |
| 15 | 14 | rexlimiva 3159 | . . 3 ⊢ (∃𝑥 ∈ ω ω ≈ 𝑥 → ¬ ω ∈ Fin) |
| 16 | 1, 15 | sylbi 220 | . 2 ⊢ (ω ∈ Fin → ¬ ω ∈ Fin) |
| 17 | pm2.01 190 | . 2 ⊢ ((ω ∈ Fin → ¬ ω ∈ Fin) → ¬ ω ∈ Fin) | |
| 18 | 16, 17 | ax-mp 5 | 1 ⊢ ¬ ω ∈ Fin |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 ⊆ wss 3900 ⊊ wpss 4016 class class class wbr 5108 Ord word 6387 ωcom 7911 ≈ cen 9008 Fincfn 9011 |
| 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-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-reu 3370 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-om 7912 df-1o 8514 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 |
| This theorem is used by: fineqv 9296 nnsdomg 9329 ackbij1lem18 10353 fin23lem21 10456 fin23lem28 10457 fin23lem30 10459 isfin1-2 10502 uzinf 14148 bitsf1 16660 odhash 19839 ufinffr 24303 fineqvnttrclse 35933 fineqvinfep 35934 poimirlem30 38836 diophin 44049 diophren 44086 fiphp3d 44092 |
| Copyright terms: Public domain | W3C validator |