| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 4sqlem6 | GIF version | ||
| Description: Lemma for 4sq 12606. (Contributed by Mario Carneiro, 15-Jul-2014.) |
| Ref | Expression |
|---|---|
| 4sqlem5.2 | ⊢ (𝜑 → 𝐴 ∈ ℤ) |
| 4sqlem5.3 | ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| 4sqlem5.4 | ⊢ 𝐵 = (((𝐴 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) |
| Ref | Expression |
|---|---|
| 4sqlem6 | ⊢ (𝜑 → (-(𝑀 / 2) ≤ 𝐵 ∧ 𝐵 < (𝑀 / 2))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0red 8046 | . . . 4 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 2 | 4sqlem5.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℤ) | |
| 3 | zq 9719 | . . . . . . . 8 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℚ) | |
| 4 | 2, 3 | syl 14 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℚ) |
| 5 | 4sqlem5.3 | . . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
| 6 | 5 | nnzd 9466 | . . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 7 | 2nn 9171 | . . . . . . . 8 ⊢ 2 ∈ ℕ | |
| 8 | znq 9717 | . . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 2 ∈ ℕ) → (𝑀 / 2) ∈ ℚ) | |
| 9 | 6, 7, 8 | sylancl 413 | . . . . . . 7 ⊢ (𝜑 → (𝑀 / 2) ∈ ℚ) |
| 10 | qaddcl 9728 | . . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ (𝑀 / 2) ∈ ℚ) → (𝐴 + (𝑀 / 2)) ∈ ℚ) | |
| 11 | 4, 9, 10 | syl2anc 411 | . . . . . 6 ⊢ (𝜑 → (𝐴 + (𝑀 / 2)) ∈ ℚ) |
| 12 | nnq 9726 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℚ) | |
| 13 | 5, 12 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℚ) |
| 14 | 5 | nngt0d 9053 | . . . . . 6 ⊢ (𝜑 → 0 < 𝑀) |
| 15 | 11, 13, 14 | modqcld 10439 | . . . . 5 ⊢ (𝜑 → ((𝐴 + (𝑀 / 2)) mod 𝑀) ∈ ℚ) |
| 16 | qre 9718 | . . . . 5 ⊢ (((𝐴 + (𝑀 / 2)) mod 𝑀) ∈ ℚ → ((𝐴 + (𝑀 / 2)) mod 𝑀) ∈ ℝ) | |
| 17 | 15, 16 | syl 14 | . . . 4 ⊢ (𝜑 → ((𝐴 + (𝑀 / 2)) mod 𝑀) ∈ ℝ) |
| 18 | 5 | nnred 9022 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 19 | 18 | rehalfcld 9257 | . . . 4 ⊢ (𝜑 → (𝑀 / 2) ∈ ℝ) |
| 20 | modqge0 10443 | . . . . 5 ⊢ (((𝐴 + (𝑀 / 2)) ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → 0 ≤ ((𝐴 + (𝑀 / 2)) mod 𝑀)) | |
| 21 | 11, 13, 14, 20 | syl3anc 1249 | . . . 4 ⊢ (𝜑 → 0 ≤ ((𝐴 + (𝑀 / 2)) mod 𝑀)) |
| 22 | 1, 17, 19, 21 | lesub1dd 8607 | . . 3 ⊢ (𝜑 → (0 − (𝑀 / 2)) ≤ (((𝐴 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))) |
| 23 | df-neg 8219 | . . 3 ⊢ -(𝑀 / 2) = (0 − (𝑀 / 2)) | |
| 24 | 4sqlem5.4 | . . 3 ⊢ 𝐵 = (((𝐴 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) | |
| 25 | 22, 23, 24 | 3brtr4g 4068 | . 2 ⊢ (𝜑 → -(𝑀 / 2) ≤ 𝐵) |
| 26 | modqlt 10444 | . . . . . 6 ⊢ (((𝐴 + (𝑀 / 2)) ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → ((𝐴 + (𝑀 / 2)) mod 𝑀) < 𝑀) | |
| 27 | 11, 13, 14, 26 | syl3anc 1249 | . . . . 5 ⊢ (𝜑 → ((𝐴 + (𝑀 / 2)) mod 𝑀) < 𝑀) |
| 28 | 5 | nncnd 9023 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℂ) |
| 29 | 28 | 2halvesd 9256 | . . . . 5 ⊢ (𝜑 → ((𝑀 / 2) + (𝑀 / 2)) = 𝑀) |
| 30 | 27, 29 | breqtrrd 4062 | . . . 4 ⊢ (𝜑 → ((𝐴 + (𝑀 / 2)) mod 𝑀) < ((𝑀 / 2) + (𝑀 / 2))) |
| 31 | 17, 19, 19 | ltsubaddd 8587 | . . . 4 ⊢ (𝜑 → ((((𝐴 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) < (𝑀 / 2) ↔ ((𝐴 + (𝑀 / 2)) mod 𝑀) < ((𝑀 / 2) + (𝑀 / 2)))) |
| 32 | 30, 31 | mpbird 167 | . . 3 ⊢ (𝜑 → (((𝐴 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) < (𝑀 / 2)) |
| 33 | 24, 32 | eqbrtrid 4069 | . 2 ⊢ (𝜑 → 𝐵 < (𝑀 / 2)) |
| 34 | 25, 33 | jca 306 | 1 ⊢ (𝜑 → (-(𝑀 / 2) ≤ 𝐵 ∧ 𝐵 < (𝑀 / 2))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2167 class class class wbr 4034 (class class class)co 5925 ℝcr 7897 0cc0 7898 + caddc 7901 < clt 8080 ≤ cle 8081 − cmin 8216 -cneg 8217 / cdiv 8718 ℕcn 9009 2c2 9060 ℤcz 9345 ℚcq 9712 mod cmo 10433 |
| 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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-cnex 7989 ax-resscn 7990 ax-1cn 7991 ax-1re 7992 ax-icn 7993 ax-addcl 7994 ax-addrcl 7995 ax-mulcl 7996 ax-mulrcl 7997 ax-addcom 7998 ax-mulcom 7999 ax-addass 8000 ax-mulass 8001 ax-distr 8002 ax-i2m1 8003 ax-0lt1 8004 ax-1rid 8005 ax-0id 8006 ax-rnegex 8007 ax-precex 8008 ax-cnre 8009 ax-pre-ltirr 8010 ax-pre-ltwlin 8011 ax-pre-lttrn 8012 ax-pre-apti 8013 ax-pre-ltadd 8014 ax-pre-mulgt0 8015 ax-pre-mulext 8016 ax-arch 8017 |
| This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-id 4329 df-po 4332 df-iso 4333 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-fv 5267 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-pnf 8082 df-mnf 8083 df-xr 8084 df-ltxr 8085 df-le 8086 df-sub 8218 df-neg 8219 df-reap 8621 df-ap 8628 df-div 8719 df-inn 9010 df-2 9068 df-n0 9269 df-z 9346 df-q 9713 df-rp 9748 df-fl 10379 df-mod 10434 |
| This theorem is referenced by: 4sqlem7 12580 4sqlem10 12583 |
| Copyright terms: Public domain | W3C validator |