| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > letr | GIF version | ||
| Description: Transitive law. (Contributed by NM, 12-Nov-1999.) |
| Ref | Expression |
|---|---|
| letr | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axltwlin 8341 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 < 𝐴 → (𝐶 < 𝐵 ∨ 𝐵 < 𝐴))) | |
| 2 | 1 | 3coml 1237 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 < 𝐴 → (𝐶 < 𝐵 ∨ 𝐵 < 𝐴))) |
| 3 | orcom 736 | . . . 4 ⊢ ((𝐶 < 𝐵 ∨ 𝐵 < 𝐴) ↔ (𝐵 < 𝐴 ∨ 𝐶 < 𝐵)) | |
| 4 | 2, 3 | imbitrdi 161 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 < 𝐴 → (𝐵 < 𝐴 ∨ 𝐶 < 𝐵))) |
| 5 | 4 | con3d 636 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (¬ (𝐵 < 𝐴 ∨ 𝐶 < 𝐵) → ¬ 𝐶 < 𝐴)) |
| 6 | lenlt 8349 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
| 7 | 6 | 3adant3 1044 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
| 8 | lenlt 8349 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) | |
| 9 | 8 | 3adant1 1042 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) |
| 10 | 7, 9 | anbi12d 473 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) ↔ (¬ 𝐵 < 𝐴 ∧ ¬ 𝐶 < 𝐵))) |
| 11 | ioran 760 | . . 3 ⊢ (¬ (𝐵 < 𝐴 ∨ 𝐶 < 𝐵) ↔ (¬ 𝐵 < 𝐴 ∧ ¬ 𝐶 < 𝐵)) | |
| 12 | 10, 11 | bitr4di 198 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) ↔ ¬ (𝐵 < 𝐴 ∨ 𝐶 < 𝐵))) |
| 13 | lenlt 8349 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐴)) | |
| 14 | 13 | 3adant2 1043 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐴)) |
| 15 | 5, 12, 14 | 3imtr4d 203 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 ∧ w3a 1005 ∈ wcel 2203 class class class wbr 4109 ℝcr 8126 < clt 8308 ≤ cle 8309 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-pre-ltwlin 8240 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-rab 2529 df-v 2815 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-br 4110 df-opab 4172 df-xp 4755 df-cnv 4757 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 |
| This theorem is referenced by: letri 8381 letrd 8397 le2add 8718 le2sub 8735 p1le 9123 lemul12b 9135 lemul12a 9136 zletr 9627 peano2uz2 9685 ledivge1le 10059 fznlem 10375 elfz1b 10424 elfz0fzfz0 10460 fz0fzelfz0 10461 fz0fzdiffz0 10464 elfzmlbp 10466 difelfznle 10469 elincfzoext 10538 ssfzo12bi 10570 flqge 10642 fldiv4p1lem1div2 10665 monoord 10847 leexp2r 10955 expubnd 10958 le2sq2 10977 facwordi 11102 faclbnd3 11105 facavg 11108 swrdswrdlem 11396 swrdccat 11427 fimaxre2 11912 fsumabs 12151 cvgratnnlemnexp 12210 cvgratnnlemmn 12211 algcvga 12748 prmdvdsfz 12836 prmfac1 12849 4sqlem11 13099 sincosq1lem 15690 gausslemma2dlem1a 15931 lgsquadlem1 15950 eupth2lemsfi 16473 |
| Copyright terms: Public domain | W3C validator |