![]() |
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 7241 | . . . . . 6 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 < 𝐴 ∧ 𝐴 < 𝐵) → 𝐶 < 𝐵)) | |
2 | 1 | 3coml 1146 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 < 𝐴 ∧ 𝐴 < 𝐵) → 𝐶 < 𝐵)) |
3 | 2 | expcomd 1371 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐶 < 𝐴 → 𝐶 < 𝐵))) |
4 | con3 604 | . . . 4 ⊢ ((𝐶 < 𝐴 → 𝐶 < 𝐵) → (¬ 𝐶 < 𝐵 → ¬ 𝐶 < 𝐴)) | |
5 | 3, 4 | syl6 33 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (¬ 𝐶 < 𝐵 → ¬ 𝐶 < 𝐴))) |
6 | lenlt 7243 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) | |
7 | 6 | 3adant1 957 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) |
8 | lenlt 7243 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐴)) | |
9 | 8 | 3adant2 958 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐴)) |
10 | 7, 9 | imbi12d 232 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐵 ≤ 𝐶 → 𝐴 ≤ 𝐶) ↔ (¬ 𝐶 < 𝐵 → ¬ 𝐶 < 𝐴))) |
11 | 5, 10 | sylibrd 167 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐵 ≤ 𝐶 → 𝐴 ≤ 𝐶))) |
12 | 11 | impd 251 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 102 ↔ wb 103 ∧ w3a 920 ∈ wcel 1434 class class class wbr 3787 ℝcr 7031 < clt 7204 ≤ cle 7205 |
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 2064 ax-sep 3898 ax-pow 3950 ax-pr 3966 ax-un 4190 ax-setind 4282 ax-cnex 7118 ax-resscn 7119 ax-pre-lttrn 7141 |
This theorem depends on definitions: df-bi 115 df-3an 922 df-tru 1288 df-fal 1291 df-nf 1391 df-sb 1687 df-eu 1945 df-mo 1946 df-clab 2069 df-cleq 2075 df-clel 2078 df-nfc 2209 df-ne 2247 df-nel 2341 df-ral 2354 df-rex 2355 df-rab 2358 df-v 2604 df-dif 2976 df-un 2978 df-in 2980 df-ss 2987 df-pw 3386 df-sn 3406 df-pr 3407 df-op 3409 df-uni 3604 df-br 3788 df-opab 3842 df-xp 4371 df-cnv 4373 df-pnf 7206 df-mnf 7207 df-xr 7208 df-ltxr 7209 df-le 7210 |
This theorem is referenced by: nn0ge2m1nn 8404 lbzbi 8771 |
Copyright terms: Public domain | W3C validator |