| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > abs3lem | GIF version | ||
| Description: Lemma involving absolute value of differences. (Contributed by NM, 2-Oct-1999.) |
| Ref | Expression |
|---|---|
| abs3lem | ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) → (((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2)) → (abs‘(𝐴 − 𝐵)) < 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simplll 539 | . . . . 5 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → 𝐴 ∈ ℂ) | |
| 2 | simpllr 540 | . . . . 5 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → 𝐵 ∈ ℂ) | |
| 3 | 1, 2 | subcld 8630 | . . . 4 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → (𝐴 − 𝐵) ∈ ℂ) |
| 4 | abscl 11798 | . . . 4 ⊢ ((𝐴 − 𝐵) ∈ ℂ → (abs‘(𝐴 − 𝐵)) ∈ ℝ) | |
| 5 | 3, 4 | syl 14 | . . 3 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → (abs‘(𝐴 − 𝐵)) ∈ ℝ) |
| 6 | simplrl 541 | . . . . . 6 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → 𝐶 ∈ ℂ) | |
| 7 | 1, 6 | subcld 8630 | . . . . 5 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → (𝐴 − 𝐶) ∈ ℂ) |
| 8 | abscl 11798 | . . . . 5 ⊢ ((𝐴 − 𝐶) ∈ ℂ → (abs‘(𝐴 − 𝐶)) ∈ ℝ) | |
| 9 | 7, 8 | syl 14 | . . . 4 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → (abs‘(𝐴 − 𝐶)) ∈ ℝ) |
| 10 | 6, 2 | subcld 8630 | . . . . 5 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → (𝐶 − 𝐵) ∈ ℂ) |
| 11 | abscl 11798 | . . . . 5 ⊢ ((𝐶 − 𝐵) ∈ ℂ → (abs‘(𝐶 − 𝐵)) ∈ ℝ) | |
| 12 | 10, 11 | syl 14 | . . . 4 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → (abs‘(𝐶 − 𝐵)) ∈ ℝ) |
| 13 | 9, 12 | readdcld 8348 | . . 3 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → ((abs‘(𝐴 − 𝐶)) + (abs‘(𝐶 − 𝐵))) ∈ ℝ) |
| 14 | simplrr 542 | . . 3 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → 𝐷 ∈ ℝ) | |
| 15 | abs3dif 11852 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (abs‘(𝐴 − 𝐵)) ≤ ((abs‘(𝐴 − 𝐶)) + (abs‘(𝐶 − 𝐵)))) | |
| 16 | 1, 2, 6, 15 | syl3anc 1278 | . . 3 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → (abs‘(𝐴 − 𝐵)) ≤ ((abs‘(𝐴 − 𝐶)) + (abs‘(𝐶 − 𝐵)))) |
| 17 | simprl 535 | . . . 4 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → (abs‘(𝐴 − 𝐶)) < (𝐷 / 2)) | |
| 18 | simprr 537 | . . . 4 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → (abs‘(𝐶 − 𝐵)) < (𝐷 / 2)) | |
| 19 | 9, 12, 14, 17, 18 | lt2halvesd 9535 | . . 3 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → ((abs‘(𝐴 − 𝐶)) + (abs‘(𝐶 − 𝐵))) < 𝐷) |
| 20 | 5, 13, 14, 16, 19 | lelttrd 8444 | . 2 ⊢ ((((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) ∧ ((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2))) → (abs‘(𝐴 − 𝐵)) < 𝐷) |
| 21 | 20 | ex 115 | 1 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) → (((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2)) → (abs‘(𝐴 − 𝐵)) < 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2209 class class class wbr 4128 ‘cfv 5375 (class class class)co 6078 ℂcc 8170 ℝcr 8171 + caddc 8175 < clt 8353 ≤ cle 8354 − cmin 8490 / cdiv 8995 2c2 9337 abscabs 11744 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 ax-cnex 8263 ax-resscn 8264 ax-1cn 8265 ax-1re 8266 ax-icn 8267 ax-addcl 8268 ax-addrcl 8269 ax-mulcl 8270 ax-mulrcl 8271 ax-addcom 8272 ax-mulcom 8273 ax-addass 8274 ax-mulass 8275 ax-distr 8276 ax-i2m1 8277 ax-0lt1 8278 ax-1rid 8279 ax-0id 8280 ax-rnegex 8281 ax-precex 8282 ax-cnre 8283 ax-pre-ltirr 8284 ax-pre-ltwlin 8285 ax-pre-lttrn 8286 ax-pre-apti 8287 ax-pre-ltadd 8288 ax-pre-mulgt0 8289 ax-pre-mulext 8290 ax-arch 8291 ax-caucvg 8292 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-po 4439 df-iso 4440 df-iord 4509 df-on 4511 df-ilim 4512 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6031 df-ov 6081 df-oprab 6082 df-mpo 6083 df-1st 6367 df-2nd 6368 df-recs 6569 df-frec 6655 df-pnf 8355 df-mnf 8356 df-xr 8357 df-ltxr 8358 df-le 8359 df-sub 8492 df-neg 8493 df-reap 8896 df-ap 8903 df-div 8996 df-inn 9287 df-2 9345 df-3 9346 df-4 9347 df-n0 9546 df-z 9627 df-uz 9904 df-rp 10037 df-seqfrec 10866 df-exp 10957 df-cj 11588 df-re 11589 df-im 11590 df-rsqrt 11745 df-abs 11746 |
| This theorem is referenced by: cau3 11862 abs3lemi 11904 abs3lemd 11948 climuni 12040 2clim 12048 addcn2 12057 mulcn2 12059 |
| Copyright terms: Public domain | W3C validator |