| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ceilbi | Structured version Visualization version GIF version | ||
| Description: A condition equivalent to ceiling. Analogous to flbi 13996. (Contributed by AV, 2-Nov-2025.) |
| Ref | Expression |
|---|---|
| ceilbi | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((⌈‘𝐴) = 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐴 + 1)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ceilval 14018 | . . . 4 ⊢ (𝐴 ∈ ℝ → (⌈‘𝐴) = -(⌊‘ -𝐴)) | |
| 2 | 1 | adantr 486 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (⌈‘𝐴) = -(⌊‘ -𝐴)) |
| 3 | 2 | eqeq1d 2765 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((⌈‘𝐴) = 𝐵 ↔ -(⌊‘ -𝐴) = 𝐵)) |
| 4 | renegcl 11660 | . . . . 5 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 5 | 4 | flcld 13978 | . . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘ -𝐴) ∈ ℤ) |
| 6 | 5 | zcnd 12844 | . . 3 ⊢ (𝐴 ∈ ℝ → (⌊‘ -𝐴) ∈ ℂ) |
| 7 | zcn 12738 | . . 3 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℂ) | |
| 8 | negcon1 11649 | . . 3 ⊢ (((⌊‘ -𝐴) ∈ ℂ ∧ 𝐵 ∈ ℂ) → ( -(⌊‘ -𝐴) = 𝐵 ↔ -𝐵 = (⌊‘ -𝐴))) | |
| 9 | 6, 7, 8 | syl2an 608 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ( -(⌊‘ -𝐴) = 𝐵 ↔ -𝐵 = (⌊‘ -𝐴))) |
| 10 | eqcom 2770 | . . . 4 ⊢ ( -𝐵 = (⌊‘ -𝐴) ↔ (⌊‘ -𝐴) = -𝐵) | |
| 11 | 10 | a1i 11 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ( -𝐵 = (⌊‘ -𝐴) ↔ (⌊‘ -𝐴) = -𝐵)) |
| 12 | znegcl 12771 | . . . 4 ⊢ (𝐵 ∈ ℤ → -𝐵 ∈ ℤ) | |
| 13 | flbi 13996 | . . . 4 ⊢ (( -𝐴 ∈ ℝ ∧ -𝐵 ∈ ℤ) → ((⌊‘ -𝐴) = -𝐵 ↔ ( -𝐵 ≤ -𝐴 ∧ -𝐴 < ( -𝐵 + 1)))) | |
| 14 | 4, 12, 13 | syl2an 608 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((⌊‘ -𝐴) = -𝐵 ↔ ( -𝐵 ≤ -𝐴 ∧ -𝐴 < ( -𝐵 + 1)))) |
| 15 | simpl 488 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℝ) | |
| 16 | zre 12737 | . . . . . . 7 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
| 17 | 16 | adantl 487 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℝ) |
| 18 | 15, 17 | lenegd 11935 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐴 ≤ 𝐵 ↔ -𝐵 ≤ -𝐴)) |
| 19 | 18 | bicomd 226 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ( -𝐵 ≤ -𝐴 ↔ 𝐴 ≤ 𝐵)) |
| 20 | peano2rem 11664 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → (𝐵 − 1) ∈ ℝ) | |
| 21 | 16, 20 | syl 18 | . . . . . . 7 ⊢ (𝐵 ∈ ℤ → (𝐵 − 1) ∈ ℝ) |
| 22 | 21 | adantl 487 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 − 1) ∈ ℝ) |
| 23 | 22, 15 | ltnegd 11934 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((𝐵 − 1) < 𝐴 ↔ -𝐴 < -(𝐵 − 1))) |
| 24 | 1red 11348 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 1 ∈ ℝ) | |
| 25 | 17, 24, 15 | ltsubaddd 11952 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((𝐵 − 1) < 𝐴 ↔ 𝐵 < (𝐴 + 1))) |
| 26 | 1cnd 11341 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → 1 ∈ ℂ) | |
| 27 | negsubdi 11653 | . . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 1 ∈ ℂ) → -(𝐵 − 1) = ( -𝐵 + 1)) | |
| 28 | 7, 26, 27 | syl2anr 609 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → -(𝐵 − 1) = ( -𝐵 + 1)) |
| 29 | 28 | breq2d 5120 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ( -𝐴 < -(𝐵 − 1) ↔ -𝐴 < ( -𝐵 + 1))) |
| 30 | 23, 25, 29 | 3bitr3rd 313 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ( -𝐴 < ( -𝐵 + 1) ↔ 𝐵 < (𝐴 + 1))) |
| 31 | 19, 30 | anbi12d 644 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (( -𝐵 ≤ -𝐴 ∧ -𝐴 < ( -𝐵 + 1)) ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐴 + 1)))) |
| 32 | 11, 14, 31 | 3bitrd 308 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ( -𝐵 = (⌊‘ -𝐴) ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐴 + 1)))) |
| 33 | 3, 9, 32 | 3bitrd 308 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((⌈‘𝐴) = 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐴 + 1)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 ℝcr 11238 1c1 11240 + caddc 11242 < clt 11382 ≤ cle 11383 − cmin 11580 -cneg 11581 ℤcz 12733 ⌊cfl 13970 ⌈cceil 13971 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-fl 13972 df-ceil 13973 |
| This theorem is used by: ceilhalf1 48742 |
| Copyright terms: Public domain | W3C validator |