| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > leadd1 | GIF version | ||
| Description: Addition to both sides of 'less than or equal to'. Part of definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 18-Oct-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| leadd1 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ (𝐴 + 𝐶) ≤ (𝐵 + 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltadd1 8517 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐴 ↔ (𝐵 + 𝐶) < (𝐴 + 𝐶))) | |
| 2 | 1 | 3com12 1210 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐴 ↔ (𝐵 + 𝐶) < (𝐴 + 𝐶))) |
| 3 | 2 | notbid 669 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (¬ 𝐵 < 𝐴 ↔ ¬ (𝐵 + 𝐶) < (𝐴 + 𝐶))) |
| 4 | simp1 1000 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 5 | simp2 1001 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℝ) | |
| 6 | 4, 5 | lenltd 8205 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
| 7 | simp3 1002 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℝ) | |
| 8 | 4, 7 | readdcld 8117 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 + 𝐶) ∈ ℝ) |
| 9 | 5, 7 | readdcld 8117 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 + 𝐶) ∈ ℝ) |
| 10 | 8, 9 | lenltd 8205 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 + 𝐶) ≤ (𝐵 + 𝐶) ↔ ¬ (𝐵 + 𝐶) < (𝐴 + 𝐶))) |
| 11 | 3, 6, 10 | 3bitr4d 220 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ (𝐴 + 𝐶) ≤ (𝐵 + 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 105 ∧ w3a 981 ∈ wcel 2177 class class class wbr 4050 (class class class)co 5956 ℝcr 7939 + caddc 7943 < clt 8122 ≤ cle 8123 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4169 ax-pow 4225 ax-pr 4260 ax-un 4487 ax-setind 4592 ax-cnex 8031 ax-resscn 8032 ax-1cn 8033 ax-icn 8035 ax-addcl 8036 ax-addrcl 8037 ax-mulcl 8038 ax-addcom 8040 ax-addass 8042 ax-i2m1 8045 ax-0id 8048 ax-rnegex 8049 ax-pre-ltadd 8056 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-rab 2494 df-v 2775 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-pw 3622 df-sn 3643 df-pr 3644 df-op 3646 df-uni 3856 df-br 4051 df-opab 4113 df-xp 4688 df-cnv 4690 df-iota 5240 df-fv 5287 df-ov 5959 df-pnf 8124 df-mnf 8125 df-xr 8126 df-ltxr 8127 df-le 8128 |
| This theorem is referenced by: leadd2 8519 lesubadd 8522 leaddsub 8526 le2add 8532 leadd1i 8591 leadd1d 8627 zleltp1 9443 eluzp1p1 9689 eluzaddi 9690 icoshft 10127 iccshftr 10131 fzen 10180 fzaddel 10196 fznatpl1 10213 fldiv4p1lem1div2 10465 faclbnd6 10906 |
| Copyright terms: Public domain | W3C validator |