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 12235 | . 2 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 207 ∧ wa 396 ∈ wcel 2105 class class class wbr 5057 ‘cfv 6348 ≤ cle 10664 ℤcz 11969 ℤ≥cuz 12231 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pr 5320 ax-cnex 10581 ax-resscn 10582 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-iota 6307 df-fun 6350 df-fv 6356 df-ov 7148 df-neg 10861 df-z 11970 df-uz 12232 |
This theorem is referenced by: eluzaddi 12259 eluzsubi 12260 eluz2b1 12307 fz0to4untppr 12998 faclbnd4lem1 13641 climcndslem1 15192 ef01bndlem 15525 sin01bnd 15526 cos01bnd 15527 sin01gt0 15531 dvradcnv 24936 bposlem3 25789 bposlem4 25790 bposlem5 25791 bposlem9 25795 istrkg3ld 26174 axlowdimlem16 26670 ballotlem2 31645 nn0prpwlem 33567 jm2.20nn 39472 stoweidlem17 42179 wallispilem4 42230 nn0o1gt2ALTV 43736 |
Copyright terms: Public domain | W3C validator |