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 4091 | . 2 ⊢ (𝑛 ∈ (ω ∖ {∅}) → 𝑛 ∈ ω) | |
2 | bnj923.1 | . 2 ⊢ 𝐷 = (ω ∖ {∅}) | |
3 | 1, 2 | eleq2s 2931 | 1 ⊢ (𝑛 ∈ 𝐷 → 𝑛 ∈ ω) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 ∖ cdif 3921 ∅c0 4279 {csn 4553 ωcom 7566 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3488 df-dif 3927 |
This theorem is referenced by: bnj1098 32062 bnj544 32173 bnj546 32175 bnj594 32191 bnj580 32192 bnj966 32223 bnj967 32224 bnj970 32226 bnj1001 32238 bnj1053 32255 bnj1071 32256 bnj1118 32263 bnj1128 32269 bnj1145 32272 |
Copyright terms: Public domain | W3C validator |