| 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 8981 | . . . 4 ⊢ ∅ ∈ Fin | |
| 2 | eleq1 2823 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 ∈ Fin ↔ ∅ ∈ Fin)) | |
| 3 | 1, 2 | mpbiri 258 | . . 3 ⊢ (𝐴 = ∅ → 𝐴 ∈ Fin) |
| 4 | 3 | con3i 154 | . 2 ⊢ (¬ 𝐴 ∈ Fin → ¬ 𝐴 = ∅) |
| 5 | neq0 4303 | . 2 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 6 | 4, 5 | sylib 218 | 1 ⊢ (¬ 𝐴 ∈ Fin → ∃𝑥 𝑥 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ∅c0 4284 Fincfn 8885 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pr 5376 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-mo 2538 df-clab 2714 df-cleq 2727 df-clel 2810 df-ne 2932 df-ral 3051 df-rex 3060 df-rab 3399 df-v 3441 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-ord 6319 df-on 6320 df-lim 6321 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-om 7809 df-en 8886 df-fin 8889 |
| This theorem is referenced by: cusgrfi 29513 esumcst 34199 topdifinffinlem 37521 |
| Copyright terms: Public domain | W3C validator |