| 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 9279. (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 8970 | . 2 ⊢ (ω ≼ 𝐴 → ∃𝑓 𝑓:ω–1-1→𝐴) | |
| 2 | peano1 7889 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 3 | f1f1orn 6828 | . . . . . . . . 9 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω–1-1-onto→ran 𝑓) | |
| 4 | 3 | adantr 486 | . . . . . . . 8 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → 𝑓:ω–1-1-onto→ran 𝑓) |
| 5 | f1f 6770 | . . . . . . . . . . 11 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω⟶𝐴) | |
| 6 | 5 | frnd 6710 | . . . . . . . . . 10 ⊢ (𝑓:ω–1-1→𝐴 → ran 𝑓 ⊆ 𝐴) |
| 7 | sseq0 4354 | . . . . . . . . . 10 ⊢ ((ran 𝑓 ⊆ 𝐴 ∧ 𝐴 = ∅) → ran 𝑓 = ∅) | |
| 8 | 6, 7 | sylan 592 | . . . . . . . . 9 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → ran 𝑓 = ∅) |
| 9 | 8 | f1oeq3d 6813 | . . . . . . . 8 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → (𝑓:ω–1-1-onto→ran 𝑓 ↔ 𝑓:ω–1-1-onto→∅)) |
| 10 | 4, 9 | mpbid 235 | . . . . . . 7 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → 𝑓:ω–1-1-onto→∅) |
| 11 | f1ocnv 6829 | . . . . . . 7 ⊢ (𝑓:ω–1-1-onto→∅ → ◡𝑓:∅–1-1-onto→ω) | |
| 12 | noel 4284 | . . . . . . . 8 ⊢ ¬ ∅ ∈ ∅ | |
| 13 | f1o00 6852 | . . . . . . . . . 10 ⊢ (◡𝑓:∅–1-1-onto→ω ↔ (◡𝑓 = ∅ ∧ ω = ∅)) | |
| 14 | 13 | simprbi 503 | . . . . . . . . 9 ⊢ (◡𝑓:∅–1-1-onto→ω → ω = ∅) |
| 15 | 14 | eleq2d 2847 | . . . . . . . 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 2963 | . . 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 2956 ⊆ wss 3899 ∅c0 4279 class class class wbr 5103 ◡ccnv 5650 ran crn 5652 –1-1→wf1 6528 –1-1-onto→wf1o 6530 ωcom 7866 ≼ cdom 8955 |
| 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 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| 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 2565 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-ord 6358 df-on 6359 df-lim 6360 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-om 7867 df-dom 8959 |
| This theorem is used by: infpwfien 10122 infxp 10273 infpss 10275 alephmul 10644 csdfil 24193 |
| Copyright terms: Public domain | W3C validator |