| 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 7733, see infn0ALT 9262. (Contributed by NM, 23-Oct-2004.) Avoid ax-un 7733. (Revised by BTernaryTau, 8-Jan-2025.) |
| Ref | Expression |
|---|---|
| infn0 | ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brdomi 8955 | . 2 ⊢ (ω ≼ 𝐴 → ∃𝑓 𝑓:ω–1-1→𝐴) | |
| 2 | peano1 7884 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 3 | f1f1orn 6833 | . . . . . . . . 9 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω–1-1-onto→ran 𝑓) | |
| 4 | 3 | adantr 485 | . . . . . . . 8 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → 𝑓:ω–1-1-onto→ran 𝑓) |
| 5 | f1f 6775 | . . . . . . . . . . 11 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω⟶𝐴) | |
| 6 | 5 | frnd 6715 | . . . . . . . . . 10 ⊢ (𝑓:ω–1-1→𝐴 → ran 𝑓 ⊆ 𝐴) |
| 7 | sseq0 4367 | . . . . . . . . . 10 ⊢ ((ran 𝑓 ⊆ 𝐴 ∧ 𝐴 = ∅) → ran 𝑓 = ∅) | |
| 8 | 6, 7 | sylan 591 | . . . . . . . . 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 4299 | . . . . . . . 8 ⊢ ¬ ∅ ∈ ∅ | |
| 13 | f1o00 6857 | . . . . . . . . . 10 ⊢ (◡𝑓:∅–1-1-onto→ω ↔ (◡𝑓 = ∅ ∧ ω = ∅)) | |
| 14 | 13 | simprbi 502 | . . . . . . . . 9 ⊢ (◡𝑓:∅–1-1-onto→ω → ω = ∅) |
| 15 | 14 | eleq2d 2855 | . . . . . . . 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 405 | . . . 4 ⊢ (𝑓:ω–1-1→𝐴 → ¬ 𝐴 = ∅) |
| 20 | 19 | neqned 2971 | . . 3 ⊢ (𝑓:ω–1-1→𝐴 → 𝐴 ≠ ∅) |
| 21 | 20 | exlimiv 1957 | . 2 ⊢ (∃𝑓 𝑓:ω–1-1→𝐴 → 𝐴 ≠ ∅) |
| 22 | 1, 21 | syl 18 | 1 ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1567 ∃wex 1806 ∈ wcel 2149 ≠ wne 2964 ⊆ wss 3913 ∅c0 4294 class class class wbr 5113 ◡ccnv 5661 ran crn 5663 –1-1→wf1 6534 –1-1-onto→wf1o 6536 ωcom 7861 ≼ cdom 8940 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-mo 2573 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 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 7862 df-dom 8944 |
| This theorem is referenced by: infpwfien 10045 infxp 10196 infpss 10198 alephmul 10562 csdfil 24019 |
| Copyright terms: Public domain | W3C validator |