| 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 12861 | . 2 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∈ wcel 2143 class class class wbr 5109 ‘cfv 6536 ≤ cle 11239 ℤcz 12586 ℤ≥cuz 12857 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-pr 5404 ax-cnex 11151 ax-resscn 11152 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-iota 6492 df-fun 6538 df-fv 6544 df-ov 7413 df-neg 11439 df-z 12587 df-uz 12858 |
| This theorem is referenced by: eluz2b1 12938 faclbnd4lem1 14325 climcndslem1 15899 ef01bndlem 16235 sin01bnd 16236 cos01bnd 16237 sin01gt0 16241 dvradcnv 26584 bposlem3 27450 bposlem4 27451 bposlem5 27452 bposlem9 27456 istrkg3ld 28730 axlowdimlem16 29307 2sqr3minply 34170 ballotlem2 34879 nn0prpwlem 36853 jm2.20nn 43744 stoweidlem17 46751 wallispilem4 46802 nn0o1gt2ALTV 48479 ackval42 49496 |
| Copyright terms: Public domain | W3C validator |