| 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 12767 | . 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 5100 ‘cfv 6500 ≤ cle 11179 ℤcz 12500 ℤ≥cuz 12763 |
| 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 5243 ax-pr 5379 ax-cnex 11094 ax-resscn 11095 |
| 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 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-iota 6456 df-fun 6502 df-fv 6508 df-ov 7371 df-neg 11379 df-z 12501 df-uz 12764 |
| This theorem is referenced by: eluz2b1 12844 faclbnd4lem1 14228 climcndslem1 15784 ef01bndlem 16121 sin01bnd 16122 cos01bnd 16123 sin01gt0 16127 dvradcnv 26398 bposlem3 27265 bposlem4 27266 bposlem5 27267 bposlem9 27271 istrkg3ld 28545 axlowdimlem16 29042 2sqr3minply 33958 ballotlem2 34667 nn0prpwlem 36538 jm2.20nn 43354 stoweidlem17 46375 wallispilem4 46426 nn0o1gt2ALTV 48054 ackval42 49056 |
| Copyright terms: Public domain | W3C validator |