| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infn0 | Structured version Visualization version GIF version | ||
| Description: An infinite set is not empty. For a shorter proof using ax-un 7740, see infn0ALT 9277. (Contributed by NM, 23-Oct-2004.) Avoid ax-un 7740. (Revised by BTernaryTau, 8-Jan-2025.) |
| Ref | Expression |
|---|---|
| infn0 | ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brdomi 8969 | . 2 ⊢ (ω ≼ 𝐴 → ∃𝑓 𝑓:ω–1-1→𝐴) | |
| 2 | peano1 7889 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 3 | f1f1orn 6833 | . . . . . . . . 9 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω–1-1-onto→ran 𝑓) | |
| 4 | 3 | adantr 486 | . . . . . . . 8 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → 𝑓:ω–1-1-onto→ran 𝑓) |
| 5 | f1f 6775 | . . . . . . . . . . 11 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω⟶𝐴) | |
| 6 | 5 | frnd 6715 | . . . . . . . . . 10 ⊢ (𝑓:ω–1-1→𝐴 → ran 𝑓 ⊆ 𝐴) |
| 7 | sseq0 4357 | . . . . . . . . . 10 ⊢ ((ran 𝑓 ⊆ 𝐴 ∧ 𝐴 = ∅) → ran 𝑓 = ∅) | |
| 8 | 6, 7 | sylan 592 | . . . . . . . . 9 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → ran 𝑓 = ∅) |
| 9 | 8 | f1oeq3d 6818 | . . . . . . . 8 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → (𝑓:ω–1-1-onto→ran 𝑓 ↔ 𝑓:ω–1-1-onto→∅)) |
| 10 | 4, 9 | mpbid 235 | . . . . . . 7 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → 𝑓:ω–1-1-onto→∅) |
| 11 | f1ocnv 6834 | . . . . . . 7 ⊢ (𝑓:ω–1-1-onto→∅ → ◡𝑓:∅–1-1-onto→ω) | |
| 12 | noel 4287 | . . . . . . . 8 ⊢ ¬ ∅ ∈ ∅ | |
| 13 | f1o00 6857 | . . . . . . . . . 10 ⊢ (◡𝑓:∅–1-1-onto→ω ↔ (◡𝑓 = ∅ ∧ ω = ∅)) | |
| 14 | 13 | simprbi 503 | . . . . . . . . 9 ⊢ (◡𝑓:∅–1-1-onto→ω → ω = ∅) |
| 15 | 14 | eleq2d 2848 | . . . . . . . 8 ⊢ (◡𝑓:∅–1-1-onto→ω → (∅ ∈ ω ↔ ∅ ∈ ∅)) |
| 16 | 12, 15 | mtbiri 330 | . . . . . . 7 ⊢ (◡𝑓:∅–1-1-onto→ω → ¬ ∅ ∈ ω) |
| 17 | 10, 11, 16 | 3syl 19 | . . . . . 6 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → ¬ ∅ ∈ ω) |
| 18 | 2, 17 | mt2 203 | . . . . 5 ⊢ ¬ (𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) |
| 19 | 18 | imnani 406 | . . . 4 ⊢ (𝑓:ω–1-1→𝐴 → ¬ 𝐴 = ∅) |
| 20 | 19 | neqned 2964 | . . 3 ⊢ (𝑓:ω–1-1→𝐴 → 𝐴 ≠ ∅) |
| 21 | 20 | exlimiv 1963 | . 2 ⊢ (∃𝑓 𝑓:ω–1-1→𝐴 → 𝐴 ≠ ∅) |
| 22 | 1, 21 | syl 18 | 1 ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ≠ wne 2957 ⊆ wss 3902 ∅c0 4282 class class class wbr 5107 ◡ccnv 5658 ran crn 5660 –1-1→wf1 6534 –1-1-onto→wf1o 6536 ωcom 7866 ≼ cdom 8954 |
| 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-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| 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-sb 2100 df-mo 2566 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 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-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-ord 6364 df-on 6365 df-lim 6366 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-om 7867 df-dom 8958 |
| This theorem is used by: infpwfien 10069 infxp 10220 infpss 10222 alephmul 10591 csdfil 24126 |
| Copyright terms: Public domain | W3C validator |