| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eluz1i | Structured version Visualization version GIF version | ||
| Description: Membership in an upper set of integers. (Contributed by NM, 5-Sep-2005.) |
| Ref | Expression |
|---|---|
| eluz.1 | ⊢ 𝑀 ∈ ℤ |
| Ref | Expression |
|---|---|
| eluz1i | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluz.1 | . 2 ⊢ 𝑀 ∈ ℤ | |
| 2 | eluz1 12756 | . 2 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∈ wcel 2114 class class class wbr 5086 ‘cfv 6490 ≤ cle 11168 ℤcz 12489 ℤ≥cuz 12752 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-pr 5368 ax-cnex 11083 ax-resscn 11084 |
| 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-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-iota 6446 df-fun 6492 df-fv 6498 df-ov 7361 df-neg 11368 df-z 12490 df-uz 12753 |
| This theorem is referenced by: eluz2b1 12833 faclbnd4lem1 14217 climcndslem1 15773 ef01bndlem 16110 sin01bnd 16111 cos01bnd 16112 sin01gt0 16116 dvradcnv 26370 bposlem3 27237 bposlem4 27238 bposlem5 27239 bposlem9 27243 istrkg3ld 28517 axlowdimlem16 29014 2sqr3minply 33930 ballotlem2 34639 nn0prpwlem 36510 jm2.20nn 43428 stoweidlem17 46449 wallispilem4 46500 nn0o1gt2ALTV 48128 ackval42 49130 |
| Copyright terms: Public domain | W3C validator |