![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ltleletr | GIF version |
Description: Transitive law, weaker form of (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶. (Contributed by AV, 14-Oct-2018.) |
Ref | Expression |
---|---|
ltleletr | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lttr 8093 | . . . . . 6 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 < 𝐴 ∧ 𝐴 < 𝐵) → 𝐶 < 𝐵)) | |
2 | 1 | 3coml 1212 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 < 𝐴 ∧ 𝐴 < 𝐵) → 𝐶 < 𝐵)) |
3 | 2 | expcomd 1452 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐶 < 𝐴 → 𝐶 < 𝐵))) |
4 | con3 643 | . . . 4 ⊢ ((𝐶 < 𝐴 → 𝐶 < 𝐵) → (¬ 𝐶 < 𝐵 → ¬ 𝐶 < 𝐴)) | |
5 | 3, 4 | syl6 33 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (¬ 𝐶 < 𝐵 → ¬ 𝐶 < 𝐴))) |
6 | lenlt 8095 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) | |
7 | 6 | 3adant1 1017 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) |
8 | lenlt 8095 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐴)) | |
9 | 8 | 3adant2 1018 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐴)) |
10 | 7, 9 | imbi12d 234 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐵 ≤ 𝐶 → 𝐴 ≤ 𝐶) ↔ (¬ 𝐶 < 𝐵 → ¬ 𝐶 < 𝐴))) |
11 | 5, 10 | sylibrd 169 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐵 ≤ 𝐶 → 𝐴 ≤ 𝐶))) |
12 | 11 | impd 254 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 980 ∈ wcel 2164 class class class wbr 4029 ℝcr 7871 < clt 8054 ≤ cle 8055 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-pre-lttrn 7986 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-br 4030 df-opab 4091 df-xp 4665 df-cnv 4667 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 |
This theorem is referenced by: nn0ge2m1nn 9300 lbzbi 9681 iseqf1olemqk 10578 wrdlenge2n0 10949 gausslemma2dlem3 15179 gausslemma2dlem4 15180 |
Copyright terms: Public domain | W3C validator |