| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eluzuzle | Structured version Visualization version GIF version | ||
| Description: An integer in an upper set of integers is an element of an upper set of integers with a smaller bound. (Contributed by Alexander van der Vekens, 17-Jun-2018.) |
| Ref | Expression |
|---|---|
| eluzuzle | ⊢ ((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) → (𝐶 ∈ (ℤ≥‘𝐴) → 𝐶 ∈ (ℤ≥‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluz2 12777 | . 2 ⊢ (𝐶 ∈ (ℤ≥‘𝐴) ↔ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) | |
| 2 | simpll 766 | . . . 4 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐵 ∈ ℤ) | |
| 3 | simpr2 1196 | . . . 4 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐶 ∈ ℤ) | |
| 4 | zre 12511 | . . . . . 6 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
| 5 | 4 | ad2antrr 726 | . . . . 5 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐵 ∈ ℝ) |
| 6 | zre 12511 | . . . . . . 7 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
| 7 | 6 | 3ad2ant1 1133 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶) → 𝐴 ∈ ℝ) |
| 8 | 7 | adantl 481 | . . . . 5 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐴 ∈ ℝ) |
| 9 | zre 12511 | . . . . . . 7 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ ℝ) | |
| 10 | 9 | 3ad2ant2 1134 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶) → 𝐶 ∈ ℝ) |
| 11 | 10 | adantl 481 | . . . . 5 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐶 ∈ ℝ) |
| 12 | simplr 768 | . . . . 5 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐵 ≤ 𝐴) | |
| 13 | simpr3 1197 | . . . . 5 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐴 ≤ 𝐶) | |
| 14 | 5, 8, 11, 12, 13 | letrd 11309 | . . . 4 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐵 ≤ 𝐶) |
| 15 | eluz2 12777 | . . . 4 ⊢ (𝐶 ∈ (ℤ≥‘𝐵) ↔ (𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐵 ≤ 𝐶)) | |
| 16 | 2, 3, 14, 15 | syl3anbrc 1344 | . . 3 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐶 ∈ (ℤ≥‘𝐵)) |
| 17 | 16 | ex 412 | . 2 ⊢ ((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) → ((𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶) → 𝐶 ∈ (ℤ≥‘𝐵))) |
| 18 | 1, 17 | biimtrid 242 | 1 ⊢ ((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) → (𝐶 ∈ (ℤ≥‘𝐴) → 𝐶 ∈ (ℤ≥‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2109 class class class wbr 5102 ‘cfv 6499 ℝcr 11045 ≤ cle 11187 ℤcz 12507 ℤ≥cuz 12771 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11102 ax-resscn 11103 ax-pre-lttri 11120 ax-pre-lttrn 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-ov 7372 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11188 df-mnf 11189 df-xr 11190 df-ltxr 11191 df-le 11192 df-neg 11386 df-z 12508 df-uz 12772 |
| This theorem is referenced by: uzuzle23 12821 uzuzle24 12822 uzuzle34 12823 eluz2nn 12825 setsstruct 17123 wwlksubclwwlk 30038 smonoord 47366 wtgoldbnnsum4prm 47797 bgoldbnnsum3prm 47799 |
| Copyright terms: Public domain | W3C validator |