![]() |
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 | 0fin 9171 | . . . 4 ⊢ ∅ ∈ Fin | |
2 | eleq1 2822 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 ∈ Fin ↔ ∅ ∈ Fin)) | |
3 | 1, 2 | mpbiri 258 | . . 3 ⊢ (𝐴 = ∅ → 𝐴 ∈ Fin) |
4 | 3 | con3i 154 | . 2 ⊢ (¬ 𝐴 ∈ Fin → ¬ 𝐴 = ∅) |
5 | neq0 4346 | . 2 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
6 | 4, 5 | sylib 217 | 1 ⊢ (¬ 𝐴 ∈ Fin → ∃𝑥 𝑥 ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1542 ∃wex 1782 ∈ wcel 2107 ∅c0 4323 Fincfn 8939 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pr 5428 ax-un 7725 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-clab 2711 df-cleq 2725 df-clel 2811 df-ne 2942 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-br 5150 df-opab 5212 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-om 7856 df-en 8940 df-fin 8943 |
This theorem is referenced by: cusgrfi 28715 esumcst 33061 topdifinffinlem 36228 |
Copyright terms: Public domain | W3C validator |