![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > le2tri3i | Structured version Visualization version GIF version |
Description: Extended trichotomy law for 'less than or equal to'. (Contributed by NM, 14-Aug-2000.) |
Ref | Expression |
---|---|
lt.1 | ⊢ 𝐴 ∈ ℝ |
lt.2 | ⊢ 𝐵 ∈ ℝ |
lt.3 | ⊢ 𝐶 ∈ ℝ |
Ref | Expression |
---|---|
le2tri3i | ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) ↔ (𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lt.2 | . . . . . 6 ⊢ 𝐵 ∈ ℝ | |
2 | lt.3 | . . . . . 6 ⊢ 𝐶 ∈ ℝ | |
3 | lt.1 | . . . . . 6 ⊢ 𝐴 ∈ ℝ | |
4 | 1, 2, 3 | letri 10758 | . . . . 5 ⊢ ((𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐵 ≤ 𝐴) |
5 | 3, 1 | letri3i 10745 | . . . . . 6 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴)) |
6 | 5 | biimpri 231 | . . . . 5 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴) → 𝐴 = 𝐵) |
7 | 4, 6 | sylan2 595 | . . . 4 ⊢ ((𝐴 ≤ 𝐵 ∧ (𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴)) → 𝐴 = 𝐵) |
8 | 7 | 3impb 1112 | . . 3 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐴 = 𝐵) |
9 | 2, 3, 1 | letri 10758 | . . . . . 6 ⊢ ((𝐶 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵) → 𝐶 ≤ 𝐵) |
10 | 1, 2 | letri3i 10745 | . . . . . . 7 ⊢ (𝐵 = 𝐶 ↔ (𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) |
11 | 10 | biimpri 231 | . . . . . 6 ⊢ ((𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) → 𝐵 = 𝐶) |
12 | 9, 11 | sylan2 595 | . . . . 5 ⊢ ((𝐵 ≤ 𝐶 ∧ (𝐶 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵)) → 𝐵 = 𝐶) |
13 | 12 | 3impb 1112 | . . . 4 ⊢ ((𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵) → 𝐵 = 𝐶) |
14 | 13 | 3comr 1122 | . . 3 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐵 = 𝐶) |
15 | 3, 1, 2 | letri 10758 | . . . 4 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶) |
16 | 3, 2 | letri3i 10745 | . . . . . 6 ⊢ (𝐴 = 𝐶 ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴)) |
17 | 16 | biimpri 231 | . . . . 5 ⊢ ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐴 = 𝐶) |
18 | 17 | eqcomd 2804 | . . . 4 ⊢ ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐶 = 𝐴) |
19 | 15, 18 | stoic3 1778 | . . 3 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐶 = 𝐴) |
20 | 8, 14, 19 | 3jca 1125 | . 2 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → (𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴)) |
21 | 3 | eqlei 10739 | . . 3 ⊢ (𝐴 = 𝐵 → 𝐴 ≤ 𝐵) |
22 | 1 | eqlei 10739 | . . 3 ⊢ (𝐵 = 𝐶 → 𝐵 ≤ 𝐶) |
23 | 2 | eqlei 10739 | . . 3 ⊢ (𝐶 = 𝐴 → 𝐶 ≤ 𝐴) |
24 | 21, 22, 23 | 3anim123i 1148 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴) → (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴)) |
25 | 20, 24 | impbii 212 | 1 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) ↔ (𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 class class class wbr 5030 ℝcr 10525 ≤ cle 10665 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-resscn 10583 ax-pre-lttri 10600 ax-pre-lttrn 10601 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |