![]() |
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 209 ∧ wa 399 ∈ wcel 2111 class class class wbr 5030 ‘cfv 6324 ≤ cle 10665 ℤcz 11969 ℤ≥cuz 12231 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 ax-cnex 10582 ax-resscn 10583 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-iota 6283 df-fun 6326 df-fv 6332 df-ov 7138 df-neg 10862 df-z 11970 df-uz 12232 |
This theorem is referenced by: eluzaddi 12259 eluzsubi 12260 eluz2b1 12307 fz0to4untppr 13005 faclbnd4lem1 13649 climcndslem1 15196 ef01bndlem 15529 sin01bnd 15530 cos01bnd 15531 sin01gt0 15535 dvradcnv 25016 bposlem3 25870 bposlem4 25871 bposlem5 25872 bposlem9 25876 istrkg3ld 26255 axlowdimlem16 26751 ballotlem2 31856 nn0prpwlem 33783 jm2.20nn 39938 stoweidlem17 42659 wallispilem4 42710 nn0o1gt2ALTV 44212 ackval42 45110 |
Copyright terms: Public domain | W3C validator |