| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > leaddsub | GIF version | ||
| Description: 'Less than or equal to' relationship between addition and subtraction. (Contributed by NM, 6-Apr-2005.) |
| Ref | Expression |
|---|---|
| leaddsub | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 + 𝐵) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 − 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1028 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 2 | simp3 1030 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℝ) | |
| 3 | simp2 1029 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℝ) | |
| 4 | 2, 3 | resubcld 8710 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 − 𝐵) ∈ ℝ) |
| 5 | leadd1 8760 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐶 − 𝐵) ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ (𝐶 − 𝐵) ↔ (𝐴 + 𝐵) ≤ ((𝐶 − 𝐵) + 𝐵))) | |
| 6 | 1, 4, 3, 5 | syl3anc 1278 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ (𝐶 − 𝐵) ↔ (𝐴 + 𝐵) ≤ ((𝐶 − 𝐵) + 𝐵))) |
| 7 | 2 | recnd 8355 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℂ) |
| 8 | 3 | recnd 8355 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℂ) |
| 9 | 7, 8 | npcand 8643 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 − 𝐵) + 𝐵) = 𝐶) |
| 10 | 9 | breq2d 4142 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 + 𝐵) ≤ ((𝐶 − 𝐵) + 𝐵) ↔ (𝐴 + 𝐵) ≤ 𝐶)) |
| 11 | 6, 10 | bitr2d 189 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 + 𝐵) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 − 𝐵))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 105 ∧ w3a 1009 ∈ wcel 2209 class class class wbr 4130 (class class class)co 6085 ℝcr 8179 + caddc 8183 ≤ cle 8362 − cmin 8499 |
| This proof depends on 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-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-addcom 8280 ax-addass 8282 ax-distr 8284 ax-i2m1 8285 ax-0id 8288 ax-rnegex 8289 ax-cnre 8291 ax-pre-ltadd 8296 |
| This proof depends on definitions: df-bi 117 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-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-iota 5337 df-fun 5379 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 |
| This theorem is used by: leaddsub2 8769 lesub 8771 lesub2 8787 subge0 8805 lesub3d 8893 div4p1lem1div2 9564 eluzp1m1 9956 eluzsubi 9960 eluzsub 9962 fzen 10458 fznatpl1 10494 seq3f1olemqsumkj 10963 bcval5 11217 uzwodc 12833 hashdvds 13022 chtublem 16256 |
| Copyright terms: Public domain | W3C validator |