| 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 7734, see infn0ALT 9264. (Contributed by NM, 23-Oct-2004.) Avoid ax-un 7734. (Revised by BTernaryTau, 8-Jan-2025.) |
| Ref | Expression |
|---|---|
| infn0 | ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brdomi 8957 | . 2 ⊢ (ω ≼ 𝐴 → ∃𝑓 𝑓:ω–1-1→𝐴) | |
| 2 | peano1 7886 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 3 | f1f1orn 6834 | . . . . . . . . 9 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω–1-1-onto→ran 𝑓) | |
| 4 | 3 | adantr 485 | . . . . . . . 8 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → 𝑓:ω–1-1-onto→ran 𝑓) |
| 5 | f1f 6776 | . . . . . . . . . . 11 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω⟶𝐴) | |
| 6 | 5 | frnd 6716 | . . . . . . . . . 10 ⊢ (𝑓:ω–1-1→𝐴 → ran 𝑓 ⊆ 𝐴) |
| 7 | sseq0 4362 | . . . . . . . . . 10 ⊢ ((ran 𝑓 ⊆ 𝐴 ∧ 𝐴 = ∅) → ran 𝑓 = ∅) | |
| 8 | 6, 7 | sylan 591 | . . . . . . . . 9 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → ran 𝑓 = ∅) |
| 9 | 8 | f1oeq3d 6819 | . . . . . . . 8 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → (𝑓:ω–1-1-onto→ran 𝑓 ↔ 𝑓:ω–1-1-onto→∅)) |
| 10 | 4, 9 | mpbid 235 | . . . . . . 7 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → 𝑓:ω–1-1-onto→∅) |
| 11 | f1ocnv 6835 | . . . . . . 7 ⊢ (𝑓:ω–1-1-onto→∅ → ◡𝑓:∅–1-1-onto→ω) | |
| 12 | noel 4292 | . . . . . . . 8 ⊢ ¬ ∅ ∈ ∅ | |
| 13 | f1o00 6858 | . . . . . . . . . 10 ⊢ (◡𝑓:∅–1-1-onto→ω ↔ (◡𝑓 = ∅ ∧ ω = ∅)) | |
| 14 | 13 | simprbi 502 | . . . . . . . . 9 ⊢ (◡𝑓:∅–1-1-onto→ω → ω = ∅) |
| 15 | 14 | eleq2d 2849 | . . . . . . . 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 2965 | . . 3 ⊢ (𝑓:ω–1-1→𝐴 → 𝐴 ≠ ∅) |
| 21 | 20 | exlimiv 1960 | . 2 ⊢ (∃𝑓 𝑓:ω–1-1→𝐴 → 𝐴 ≠ ∅) |
| 22 | 1, 21 | syl 18 | 1 ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∃wex 1809 ∈ wcel 2143 ≠ wne 2958 ⊆ wss 3906 ∅c0 4287 class class class wbr 5110 ◡ccnv 5662 ran crn 5664 –1-1→wf1 6535 –1-1-onto→wf1o 6537 ωcom 7863 ≼ cdom 8942 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-mo 2567 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-ord 6365 df-on 6366 df-lim 6367 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-om 7864 df-dom 8946 |
| This theorem is referenced by: infpwfien 10047 infxp 10198 infpss 10200 alephmul 10564 csdfil 24032 |
| Copyright terms: Public domain | W3C validator |