| 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 12866 | . 2 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∈ wcel 2149 class class class wbr 5113 ‘cfv 6537 ≤ cle 11244 ℤcz 12591 ℤ≥cuz 12862 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-pr 5405 ax-cnex 11156 ax-resscn 11157 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7414 df-neg 11444 df-z 12592 df-uz 12863 |
| This theorem is referenced by: eluz2b1 12943 faclbnd4lem1 14329 climcndslem1 15903 ef01bndlem 16240 sin01bnd 16241 cos01bnd 16242 sin01gt0 16246 dvradcnv 26550 bposlem3 27416 bposlem4 27417 bposlem5 27418 bposlem9 27422 istrkg3ld 28696 axlowdimlem16 29248 2sqr3minply 34115 ballotlem2 34824 nn0prpwlem 36756 jm2.20nn 43650 stoweidlem17 46657 wallispilem4 46708 nn0o1gt2ALTV 48382 ackval42 49395 |
| Copyright terms: Public domain | W3C validator |