| 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 13009 | . 2 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∈ wcel 2147 class class class wbr 5108 ‘cfv 6566 ≤ cle 11383 ℤcz 12733 ℤ≥cuz 13005 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-pr 5398 ax-cnex 11295 ax-resscn 11296 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-iota 6520 df-fun 6568 df-fv 6574 df-ov 7454 df-neg 11583 df-z 12734 df-uz 13006 |
| This theorem is used by: eluz2b1 13086 faclbnd4lem1 14478 climcndslem1 16062 ef01bndlem 16396 sin01bnd 16397 cos01bnd 16398 sin01gt0 16402 dvradcnv 26805 bposlem3 27670 bposlem4 27671 bposlem5 27672 bposlem9 27676 istrkg3ld 28980 axlowdimlem16 29592 2sqr3minply 34523 ballotlem2 35232 nn0prpwlem 37325 jm2.20nn 44270 stoweidlem17 47361 wallispilem4 47412 nn0o1gt2ALTV 49126 ackval42 50200 |
| Copyright terms: Public domain | W3C validator |