![]() |
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 7636 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐴 ↔ (𝐵 + 𝐶) < (𝐴 + 𝐶))) | |
2 | 1 | 3com12 1143 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐴 ↔ (𝐵 + 𝐶) < (𝐴 + 𝐶))) |
3 | 2 | notbid 625 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (¬ 𝐵 < 𝐴 ↔ ¬ (𝐵 + 𝐶) < (𝐴 + 𝐶))) |
4 | simp1 939 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℝ) | |
5 | simp2 940 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℝ) | |
6 | 4, 5 | lenltd 7330 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
7 | simp3 941 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℝ) | |
8 | 4, 7 | readdcld 7246 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 + 𝐶) ∈ ℝ) |
9 | 5, 7 | readdcld 7246 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 + 𝐶) ∈ ℝ) |
10 | 8, 9 | lenltd 7330 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 + 𝐶) ≤ (𝐵 + 𝐶) ↔ ¬ (𝐵 + 𝐶) < (𝐴 + 𝐶))) |
11 | 3, 6, 10 | 3bitr4d 218 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ (𝐴 + 𝐶) ≤ (𝐵 + 𝐶))) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 103 ∧ w3a 920 ∈ wcel 1434 class class class wbr 3806 (class class class)co 5564 ℝcr 7078 + caddc 7082 < clt 7251 ≤ cle 7252 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 577 ax-in2 578 ax-io 663 ax-5 1377 ax-7 1378 ax-gen 1379 ax-ie1 1423 ax-ie2 1424 ax-8 1436 ax-10 1437 ax-11 1438 ax-i12 1439 ax-bndl 1440 ax-4 1441 ax-13 1445 ax-14 1446 ax-17 1460 ax-i9 1464 ax-ial 1468 ax-i5r 1469 ax-ext 2065 ax-sep 3917 ax-pow 3969 ax-pr 3993 ax-un 4217 ax-setind 4309 ax-cnex 7165 ax-resscn 7166 ax-1cn 7167 ax-icn 7169 ax-addcl 7170 ax-addrcl 7171 ax-mulcl 7172 ax-addcom 7174 ax-addass 7176 ax-i2m1 7179 ax-0id 7182 ax-rnegex 7183 ax-pre-ltadd 7190 |
This theorem depends on definitions: df-bi 115 df-3an 922 df-tru 1288 df-fal 1291 df-nf 1391 df-sb 1688 df-eu 1946 df-mo 1947 df-clab 2070 df-cleq 2076 df-clel 2079 df-nfc 2212 df-ne 2250 df-nel 2345 df-ral 2358 df-rex 2359 df-rab 2362 df-v 2612 df-dif 2985 df-un 2987 df-in 2989 df-ss 2996 df-pw 3403 df-sn 3423 df-pr 3424 df-op 3426 df-uni 3623 df-br 3807 df-opab 3861 df-xp 4398 df-cnv 4400 df-iota 4918 df-fv 4961 df-ov 5567 df-pnf 7253 df-mnf 7254 df-xr 7255 df-ltxr 7256 df-le 7257 |
This theorem is referenced by: leadd2 7638 lesubadd 7641 leaddsub 7645 le2add 7651 leadd1i 7707 leadd1d 7742 zleltp1 8523 eluzp1p1 8761 eluzaddi 8762 icoshft 9124 iccshftr 9128 fzen 9174 fzaddel 9189 fznatpl1 9205 fldiv4p1lem1div2 9423 faclbnd6 9804 |
Copyright terms: Public domain | W3C validator |