![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > eluz | GIF version |
Description: Membership in an upper set of integers. (Contributed by NM, 2-Oct-2005.) |
Ref | Expression |
---|---|
eluz | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluz1 9508 | . 2 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))) | |
2 | 1 | baibd 923 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ 𝑁)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2148 class class class wbr 4000 ‘cfv 5211 ≤ cle 7970 ℤcz 9229 ℤ≥cuz 9504 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4118 ax-pow 4171 ax-pr 4205 ax-cnex 7880 ax-resscn 7881 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-rab 2464 df-v 2739 df-sbc 2963 df-un 3133 df-in 3135 df-ss 3142 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-br 4001 df-opab 4062 df-mpt 4063 df-id 4289 df-xp 4628 df-rel 4629 df-cnv 4630 df-co 4631 df-dm 4632 df-iota 5173 df-fun 5213 df-fv 5219 df-ov 5871 df-neg 8108 df-z 9230 df-uz 9505 |
This theorem is referenced by: uzneg 9522 uztric 9525 uzm1 9534 eluzdc 9586 fzn 10015 fzsplit2 10023 fznn 10062 uzsplit 10065 elfz2nn0 10085 fzouzsplit 10152 exfzdc 10213 fzfig 10403 faclbnd 10692 seq3coll 10793 cvg1nlemcau 10964 cvg1nlemres 10965 summodclem2a 11360 fsum0diaglem 11419 mertenslemi1 11514 prodmodclem2a 11555 zsupcllemstep 11916 zsupcl 11918 infssuzex 11920 pcpremul 12263 pcdvdsb 12289 pcadd 12309 pcfac 12318 pcbc 12319 prmunb 12330 uzdcinzz 14172 |
Copyright terms: Public domain | W3C validator |