| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ltletr | GIF version | ||
| Description: Transitive law. Part of Definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 25-Aug-1999.) |
| Ref | Expression |
|---|---|
| ltletr | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simprr 531 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐵 ≤ 𝐶) | |
| 2 | simpl2 1025 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐵 ∈ ℝ) | |
| 3 | simpl3 1026 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐶 ∈ ℝ) | |
| 4 | lenlt 8245 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) | |
| 5 | 2, 3, 4 | syl2anc 411 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) |
| 6 | 1, 5 | mpbid 147 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → ¬ 𝐶 < 𝐵) |
| 7 | simprl 529 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐴 < 𝐵) | |
| 8 | axltwlin 8237 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐴 < 𝐶 ∨ 𝐶 < 𝐵))) | |
| 9 | 8 | adantr 276 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (𝐴 < 𝐵 → (𝐴 < 𝐶 ∨ 𝐶 < 𝐵))) |
| 10 | 7, 9 | mpd 13 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (𝐴 < 𝐶 ∨ 𝐶 < 𝐵)) |
| 11 | 6, 10 | ecased 1383 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐴 < 𝐶) |
| 12 | 11 | ex 115 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 713 ∧ w3a 1002 ∈ wcel 2200 class class class wbr 4086 ℝcr 8021 < clt 8204 ≤ cle 8205 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-pre-ltwlin 8135 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2802 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-br 4087 df-opab 4149 df-xp 4729 df-cnv 4731 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 |
| This theorem is referenced by: ltletri 8276 ltletrd 8593 ltleadd 8616 nngt0 9158 nnrecgt0 9171 elnnnn0c 9437 elnnz1 9492 zltp1le 9524 uz3m2nn 9797 ledivge1le 9951 addlelt 9993 zltaddlt1le 10232 elfz1b 10315 elfzodifsumelfzo 10436 ssfzo12bi 10460 swrdswrd 11276 swrdccatin1 11296 cos01gt0 12314 oddge22np1 12432 nn0seqcvgd 12603 coprm 12706 logdivlti 15595 gausslemma2dlem1a 15777 |
| Copyright terms: Public domain | W3C validator |