| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfielex | Structured version Visualization version GIF version | ||
| Description: If a class is not finite, then it contains at least one element. (Contributed by Alexander van der Vekens, 12-Jan-2018.) |
| Ref | Expression |
|---|---|
| nfielex | ⊢ (¬ 𝐴 ∈ Fin → ∃𝑥 𝑥 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0fi 9025 | . . . 4 ⊢ ∅ ∈ Fin | |
| 2 | eleq1 2852 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 ∈ Fin ↔ ∅ ∈ Fin)) | |
| 3 | 1, 2 | mpbiri 260 | . . 3 ⊢ (𝐴 = ∅ → 𝐴 ∈ Fin) |
| 4 | 3 | con3i 154 | . 2 ⊢ (¬ 𝐴 ∈ Fin → ¬ 𝐴 = ∅) |
| 5 | neq0 4306 | . 2 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 6 | 4, 5 | sylib 220 | 1 ⊢ (¬ 𝐴 ∈ Fin → ∃𝑥 𝑥 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1562 ∃wex 1801 ∈ wcel 2144 ∅c0 4287 Fincfn 8929 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pr 5392 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-sb 2093 df-mo 2568 df-clab 2743 df-cleq 2756 df-clel 2839 df-ne 2960 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-ord 6351 df-on 6352 df-lim 6353 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-om 7849 df-en 8930 df-fin 8933 |
| This theorem is referenced by: cusgrfi 29661 esumcst 34362 topdifinffinlem 37846 |
| Copyright terms: Public domain | W3C validator |