| 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 8985 | . . 3 ⊢ (ω ∈ Fin ↔ ∃𝑥 ∈ ω ω ≈ 𝑥) | |
| 2 | nnord 7874 | . . . . . . . 8 ⊢ (𝑥 ∈ ω → Ord 𝑥) | |
| 3 | ordom 7876 | . . . . . . . 8 ⊢ Ord ω | |
| 4 | ordelssne 6388 | . . . . . . . 8 ⊢ ((Ord 𝑥 ∧ Ord ω) → (𝑥 ∈ ω ↔ (𝑥 ⊆ ω ∧ 𝑥 ≠ ω))) | |
| 5 | 2, 3, 4 | sylancl 598 | . . . . . . 7 ⊢ (𝑥 ∈ ω → (𝑥 ∈ ω ↔ (𝑥 ⊆ ω ∧ 𝑥 ≠ ω))) |
| 6 | 5 | ibi 270 | . . . . . 6 ⊢ (𝑥 ∈ ω → (𝑥 ⊆ ω ∧ 𝑥 ≠ ω)) |
| 7 | df-pss 3922 | . . . . . 6 ⊢ (𝑥 ⊊ ω ↔ (𝑥 ⊆ ω ∧ 𝑥 ≠ ω)) | |
| 8 | 6, 7 | sylibr 237 | . . . . 5 ⊢ (𝑥 ∈ ω → 𝑥 ⊊ ω) |
| 9 | nnfi 9166 | . . . . . . 7 ⊢ (𝑥 ∈ ω → 𝑥 ∈ Fin) | |
| 10 | ensymfib 9182 | . . . . . . 7 ⊢ (𝑥 ∈ Fin → (𝑥 ≈ ω ↔ ω ≈ 𝑥)) | |
| 11 | 9, 10 | syl 18 | . . . . . 6 ⊢ (𝑥 ∈ ω → (𝑥 ≈ ω ↔ ω ≈ 𝑥)) |
| 12 | 11 | biimpar 483 | . . . . 5 ⊢ ((𝑥 ∈ ω ∧ ω ≈ 𝑥) → 𝑥 ≈ ω) |
| 13 | pssinf 9236 | . . . . 5 ⊢ ((𝑥 ⊊ ω ∧ 𝑥 ≈ ω) → ¬ ω ∈ Fin) | |
| 14 | 8, 12, 13 | syl2an2r 698 | . . . 4 ⊢ ((𝑥 ∈ ω ∧ ω ≈ 𝑥) → ¬ ω ∈ Fin) |
| 15 | 14 | rexlimiva 3157 | . . 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 2145 ≠ wne 2957 ∃wrex 3088 ⊆ wss 3902 ⊊ wpss 3903 class class class wbr 5107 Ord word 6360 ωcom 7866 ≈ cen 8953 Fincfn 8956 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 ax-un 7740 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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-om 7867 df-1o 8459 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 |
| This theorem is used by: fineqv 9241 nnsdomg 9273 ackbij1lem18 10242 fin23lem21 10345 fin23lem28 10346 fin23lem30 10348 isfin1-2 10391 uzinf 14033 bitsf1 16542 odhash 19707 ufinffr 24161 fineqvnttrclse 35658 fineqvinfep 35659 poimirlem30 38407 diophin 43625 diophren 43662 fiphp3d 43668 |
| Copyright terms: Public domain | W3C validator |