| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uzneg | Structured version Visualization version GIF version | ||
| Description: Contraposition law for upper integers. (Contributed by NM, 28-Nov-2005.) |
| Ref | Expression |
|---|---|
| uzneg | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → -𝑀 ∈ (ℤ≥‘-𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzle 12885 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝑁) | |
| 2 | eluzel2 12877 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 3 | eluzelz 12882 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 4 | zre 12605 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
| 5 | zre 12605 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 6 | leneg 11727 | . . . . 5 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑀 ≤ 𝑁 ↔ -𝑁 ≤ -𝑀)) | |
| 7 | 4, 5, 6 | syl2an 608 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ↔ -𝑁 ≤ -𝑀)) |
| 8 | 2, 3, 7 | syl2anc 596 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 ≤ 𝑁 ↔ -𝑁 ≤ -𝑀)) |
| 9 | 1, 8 | mpbid 235 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → -𝑁 ≤ -𝑀) |
| 10 | znegcl 12639 | . . . 4 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) | |
| 11 | znegcl 12639 | . . . 4 ⊢ (𝑀 ∈ ℤ → -𝑀 ∈ ℤ) | |
| 12 | eluz 12886 | . . . 4 ⊢ ((-𝑁 ∈ ℤ ∧ -𝑀 ∈ ℤ) → (-𝑀 ∈ (ℤ≥‘-𝑁) ↔ -𝑁 ≤ -𝑀)) | |
| 13 | 10, 11, 12 | syl2an 608 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (-𝑀 ∈ (ℤ≥‘-𝑁) ↔ -𝑁 ≤ -𝑀)) |
| 14 | 3, 2, 13 | syl2anc 596 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (-𝑀 ∈ (ℤ≥‘-𝑁) ↔ -𝑁 ≤ -𝑀)) |
| 15 | 9, 14 | mpbird 260 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → -𝑀 ∈ (ℤ≥‘-𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∈ wcel 2146 class class class wbr 5112 ‘cfv 6540 ℝcr 11109 ≤ cle 11254 -cneg 11452 ℤcz 12601 ℤ≥cuz 12872 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5260 ax-nul 5272 ax-pow 5339 ax-pr 5407 ax-un 7738 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 |
| 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 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4876 df-iun 4961 df-br 5113 df-opab 5177 df-mpt 5196 df-tr 5222 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-sub 11453 df-neg 11454 df-nn 12244 df-z 12602 df-uz 12873 |
| This theorem is used by: fsum2dsub 35007 |
| Copyright terms: Public domain | W3C validator |