![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nnullss | Structured version Visualization version GIF version |
Description: A nonempty class (even if proper) has a nonempty subset. (Contributed by NM, 23-Aug-2003.) |
Ref | Expression |
---|---|
nnullss | ⊢ (𝐴 ≠ ∅ → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0 4376 | . 2 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐴) | |
2 | vex 3492 | . . . . 5 ⊢ 𝑦 ∈ V | |
3 | 2 | snss 4810 | . . . 4 ⊢ (𝑦 ∈ 𝐴 ↔ {𝑦} ⊆ 𝐴) |
4 | 2 | snnz 4801 | . . . . 5 ⊢ {𝑦} ≠ ∅ |
5 | vsnex 5449 | . . . . . 6 ⊢ {𝑦} ∈ V | |
6 | sseq1 4034 | . . . . . . 7 ⊢ (𝑥 = {𝑦} → (𝑥 ⊆ 𝐴 ↔ {𝑦} ⊆ 𝐴)) | |
7 | neeq1 3009 | . . . . . . 7 ⊢ (𝑥 = {𝑦} → (𝑥 ≠ ∅ ↔ {𝑦} ≠ ∅)) | |
8 | 6, 7 | anbi12d 631 | . . . . . 6 ⊢ (𝑥 = {𝑦} → ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) ↔ ({𝑦} ⊆ 𝐴 ∧ {𝑦} ≠ ∅))) |
9 | 5, 8 | spcev 3619 | . . . . 5 ⊢ (({𝑦} ⊆ 𝐴 ∧ {𝑦} ≠ ∅) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅)) |
10 | 4, 9 | mpan2 690 | . . . 4 ⊢ ({𝑦} ⊆ 𝐴 → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅)) |
11 | 3, 10 | sylbi 217 | . . 3 ⊢ (𝑦 ∈ 𝐴 → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅)) |
12 | 11 | exlimiv 1929 | . 2 ⊢ (∃𝑦 𝑦 ∈ 𝐴 → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅)) |
13 | 1, 12 | sylbi 217 | 1 ⊢ (𝐴 ≠ ∅ → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∃wex 1777 ∈ wcel 2108 ≠ wne 2946 ⊆ wss 3976 ∅c0 4352 {csn 4648 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-sep 5317 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-sn 4649 df-pr 4651 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |