![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > eluzuzle | 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 9601 | . 2 ⊢ (𝐶 ∈ (ℤ≥‘𝐴) ↔ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) | |
2 | simpll 527 | . . . 4 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐵 ∈ ℤ) | |
3 | simpr2 1006 | . . . 4 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐶 ∈ ℤ) | |
4 | zre 9324 | . . . . . 6 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
5 | 4 | ad2antrr 488 | . . . . 5 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐵 ∈ ℝ) |
6 | zre 9324 | . . . . . . 7 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
7 | 6 | 3ad2ant1 1020 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶) → 𝐴 ∈ ℝ) |
8 | 7 | adantl 277 | . . . . 5 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐴 ∈ ℝ) |
9 | zre 9324 | . . . . . . 7 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ ℝ) | |
10 | 9 | 3ad2ant2 1021 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶) → 𝐶 ∈ ℝ) |
11 | 10 | adantl 277 | . . . . 5 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐶 ∈ ℝ) |
12 | simplr 528 | . . . . 5 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐵 ≤ 𝐴) | |
13 | simpr3 1007 | . . . . 5 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐴 ≤ 𝐶) | |
14 | 5, 8, 11, 12, 13 | letrd 8145 | . . . 4 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐵 ≤ 𝐶) |
15 | eluz2 9601 | . . . 4 ⊢ (𝐶 ∈ (ℤ≥‘𝐵) ↔ (𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐵 ≤ 𝐶)) | |
16 | 2, 3, 14, 15 | syl3anbrc 1183 | . . 3 ⊢ (((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶)) → 𝐶 ∈ (ℤ≥‘𝐵)) |
17 | 16 | ex 115 | . 2 ⊢ ((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) → ((𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐴 ≤ 𝐶) → 𝐶 ∈ (ℤ≥‘𝐵))) |
18 | 1, 17 | biimtrid 152 | 1 ⊢ ((𝐵 ∈ ℤ ∧ 𝐵 ≤ 𝐴) → (𝐶 ∈ (ℤ≥‘𝐴) → 𝐶 ∈ (ℤ≥‘𝐵))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 ∈ wcel 2164 class class class wbr 4030 ‘cfv 5255 ℝcr 7873 ≤ cle 8057 ℤcz 9320 ℤ≥cuz 9595 |
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-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-cnex 7965 ax-resscn 7966 ax-pre-ltwlin 7987 |
This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-sbc 2987 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-fv 5263 df-ov 5922 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-neg 8195 df-z 9321 df-uz 9596 |
This theorem is referenced by: eluz2nn 9634 eluz4eluz2 9635 uzuzle23 9639 eluzge3nn 9640 |
Copyright terms: Public domain | W3C validator |