![]() |
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 1001 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐵 ∈ ℝ) | |
3 | simpl3 1002 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐶 ∈ ℝ) | |
4 | lenlt 8035 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) | |
5 | 2, 3, 4 | syl2anc 411 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (𝐵 ≤ 𝐶 ↔ ¬ 𝐶 < 𝐵)) |
6 | 1, 5 | mpbid 147 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → ¬ 𝐶 < 𝐵) |
7 | simprl 529 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐴 < 𝐵) | |
8 | axltwlin 8027 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐴 < 𝐶 ∨ 𝐶 < 𝐵))) | |
9 | 8 | adantr 276 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (𝐴 < 𝐵 → (𝐴 < 𝐶 ∨ 𝐶 < 𝐵))) |
10 | 7, 9 | mpd 13 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (𝐴 < 𝐶 ∨ 𝐶 < 𝐵)) |
11 | 6, 10 | ecased 1349 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → 𝐴 < 𝐶) |
12 | 11 | ex 115 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 708 ∧ w3a 978 ∈ wcel 2148 class class class wbr 4005 ℝcr 7812 < clt 7994 ≤ cle 7995 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-cnex 7904 ax-resscn 7905 ax-pre-ltwlin 7926 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-rab 2464 df-v 2741 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-br 4006 df-opab 4067 df-xp 4634 df-cnv 4636 df-pnf 7996 df-mnf 7997 df-xr 7998 df-ltxr 7999 df-le 8000 |
This theorem is referenced by: ltletri 8066 ltletrd 8382 ltleadd 8405 nngt0 8946 nnrecgt0 8959 elnnnn0c 9223 elnnz1 9278 zltp1le 9309 uz3m2nn 9575 ledivge1le 9728 addlelt 9770 zltaddlt1le 10009 elfz1b 10092 elfzodifsumelfzo 10203 ssfzo12bi 10227 cos01gt0 11772 oddge22np1 11888 nn0seqcvgd 12043 coprm 12146 logdivlti 14387 |
Copyright terms: Public domain | W3C validator |