| 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 9039 | . . . 4 ⊢ ∅ ∈ Fin | |
| 2 | eleq1 2857 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 ∈ Fin ↔ ∅ ∈ Fin)) | |
| 3 | 1, 2 | mpbiri 261 | . . 3 ⊢ (𝐴 = ∅ → 𝐴 ∈ Fin) |
| 4 | 3 | con3i 155 | . 2 ⊢ (¬ 𝐴 ∈ Fin → ¬ 𝐴 = ∅) |
| 5 | neq0 4312 | . 2 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 6 | 4, 5 | sylib 221 | 1 ⊢ (¬ 𝐴 ∈ Fin → ∃𝑥 𝑥 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1567 ∃wex 1806 ∈ wcel 2149 ∅c0 4292 Fincfn 8943 |
| 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 5259 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 3423 df-v 3463 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5112 df-opab 5176 df-tr 5221 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 7863 df-en 8944 df-fin 8947 |
| This theorem is referenced by: cusgrfi 29749 esumcst 34398 topdifinffinlem 37916 |
| Copyright terms: Public domain | W3C validator |