| 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 7722, see infn0ALT 9251. (Contributed by NM, 23-Oct-2004.) Avoid ax-un 7722. (Revised by BTernaryTau, 8-Jan-2025.) |
| Ref | Expression |
|---|---|
| infn0 | ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brdomi 8944 | . 2 ⊢ (ω ≼ 𝐴 → ∃𝑓 𝑓:ω–1-1→𝐴) | |
| 2 | peano1 7873 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 3 | f1f1orn 6822 | . . . . . . . . 9 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω–1-1-onto→ran 𝑓) | |
| 4 | 3 | adantr 485 | . . . . . . . 8 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → 𝑓:ω–1-1-onto→ran 𝑓) |
| 5 | f1f 6764 | . . . . . . . . . . 11 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω⟶𝐴) | |
| 6 | 5 | frnd 6704 | . . . . . . . . . 10 ⊢ (𝑓:ω–1-1→𝐴 → ran 𝑓 ⊆ 𝐴) |
| 7 | sseq0 4360 | . . . . . . . . . 10 ⊢ ((ran 𝑓 ⊆ 𝐴 ∧ 𝐴 = ∅) → ran 𝑓 = ∅) | |
| 8 | 6, 7 | sylan 591 | . . . . . . . . 9 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → ran 𝑓 = ∅) |
| 9 | 8 | f1oeq3d 6807 | . . . . . . . 8 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → (𝑓:ω–1-1-onto→ran 𝑓 ↔ 𝑓:ω–1-1-onto→∅)) |
| 10 | 4, 9 | mpbid 235 | . . . . . . 7 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝐴 = ∅) → 𝑓:ω–1-1-onto→∅) |
| 11 | f1ocnv 6823 | . . . . . . 7 ⊢ (𝑓:ω–1-1-onto→∅ → ◡𝑓:∅–1-1-onto→ω) | |
| 12 | noel 4293 | . . . . . . . 8 ⊢ ¬ ∅ ∈ ∅ | |
| 13 | f1o00 6846 | . . . . . . . . . 10 ⊢ (◡𝑓:∅–1-1-onto→ω ↔ (◡𝑓 = ∅ ∧ ω = ∅)) | |
| 14 | 13 | simprbi 502 | . . . . . . . . 9 ⊢ (◡𝑓:∅–1-1-onto→ω → ω = ∅) |
| 15 | 14 | eleq2d 2851 | . . . . . . . 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 2967 | . . 3 ⊢ (𝑓:ω–1-1→𝐴 → 𝐴 ≠ ∅) |
| 21 | 20 | exlimiv 1953 | . 2 ⊢ (∃𝑓 𝑓:ω–1-1→𝐴 → 𝐴 ≠ ∅) |
| 22 | 1, 21 | syl 18 | 1 ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1563 ∃wex 1802 ∈ wcel 2145 ≠ wne 2960 ⊆ wss 3907 ∅c0 4288 class class class wbr 5104 ◡ccnv 5650 ran crn 5652 –1-1→wf1 6522 –1-1-onto→wf1o 6524 ωcom 7850 ≼ cdom 8929 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pr 5394 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-mo 2569 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5105 df-opab 5167 df-tr 5212 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 6352 df-on 6353 df-lim 6354 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-om 7851 df-dom 8933 |
| This theorem is referenced by: infpwfien 10034 infxp 10185 infpss 10187 alephmul 10551 csdfil 24008 |
| Copyright terms: Public domain | W3C validator |