| 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 9016 | . . . 4 ⊢ ∅ ∈ Fin | |
| 2 | eleq1 2817 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 ∈ Fin ↔ ∅ ∈ Fin)) | |
| 3 | 1, 2 | mpbiri 258 | . . 3 ⊢ (𝐴 = ∅ → 𝐴 ∈ Fin) |
| 4 | 3 | con3i 154 | . 2 ⊢ (¬ 𝐴 ∈ Fin → ¬ 𝐴 = ∅) |
| 5 | neq0 4318 | . 2 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 6 | 4, 5 | sylib 218 | 1 ⊢ (¬ 𝐴 ∈ Fin → ∃𝑥 𝑥 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ∅c0 4299 Fincfn 8921 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-mo 2534 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-ord 6338 df-on 6339 df-lim 6340 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-om 7846 df-en 8922 df-fin 8925 |
| This theorem is referenced by: cusgrfi 29393 esumcst 34060 topdifinffinlem 37342 |
| Copyright terms: Public domain | W3C validator |