| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj923 | Structured version Visualization version GIF version | ||
| Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj923.1 | ⊢ 𝐷 = (ω ∖ {∅}) |
| Ref | Expression |
|---|---|
| bnj923 | ⊢ (𝑛 ∈ 𝐷 → 𝑛 ∈ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifi 4064 | . 2 ⊢ (𝑛 ∈ (ω ∖ {∅}) → 𝑛 ∈ ω) | |
| 2 | bnj923.1 | . 2 ⊢ 𝐷 = (ω ∖ {∅}) | |
| 3 | 1, 2 | eleq2s 2859 | 1 ⊢ (𝑛 ∈ 𝐷 → 𝑛 ∈ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1548 ∈ wcel 2121 ∖ cdif 3882 ∅c0 4264 {csn 4558 ωcom 7810 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-tru 1551 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-v 3435 df-dif 3888 |
| This theorem is referenced by: bnj1098 34981 bnj544 35091 bnj546 35093 bnj594 35109 bnj580 35110 bnj966 35141 bnj967 35142 bnj970 35144 bnj1001 35156 bnj1053 35173 bnj1071 35174 bnj1118 35181 bnj1128 35187 bnj1145 35190 |
| Copyright terms: Public domain | W3C validator |