Theorem le2tri3i 11367

Description: Extended trichotomy law for 'less than or equal to'. (Contributed by NM, 14-Aug-2000.)

Hypotheses

Ref	Expression
lt.1	⊢ 𝐴 ∈ ℝ
lt.2	⊢ 𝐵 ∈ ℝ
lt.3	⊢ 𝐶 ∈ ℝ

Assertion

Ref	Expression
le2tri3i	⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) ↔ (𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴))

Proof of Theorem le2tri3i

Step	Hyp	Ref	Expression
1		lt.2	. . . . . 6 ⊢ 𝐵 ∈ ℝ
2		lt.3	. . . . . 6 ⊢ 𝐶 ∈ ℝ
3		lt.1	. . . . . 6 ⊢ 𝐴 ∈ ℝ
4	1, 2, 3	letri 11366	. . . . 5 ⊢ ((𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐵 ≤ 𝐴)
5	3, 1	letri3i 11353	. . . . . 6 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴))
6	5	biimpri 231	. . . . 5 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴) → 𝐴 = 𝐵)
7	4, 6	sylan2 605	. . . 4 ⊢ ((𝐴 ≤ 𝐵 ∧ (𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴)) → 𝐴 = 𝐵)
8	7	3impb 1132	. . 3 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐴 = 𝐵)
9	2, 3, 1	letri 11366	. . . . . 6 ⊢ ((𝐶 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵) → 𝐶 ≤ 𝐵)
10	1, 2	letri3i 11353	. . . . . . 7 ⊢ (𝐵 = 𝐶 ↔ (𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))
11	10	biimpri 231	. . . . . 6 ⊢ ((𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) → 𝐵 = 𝐶)
12	9, 11	sylan2 605	. . . . 5 ⊢ ((𝐵 ≤ 𝐶 ∧ (𝐶 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵)) → 𝐵 = 𝐶)
13	12	3impb 1132	. . . 4 ⊢ ((𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵) → 𝐵 = 𝐶)
14	13	3comr 1143	. . 3 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐵 = 𝐶)
15	3, 1, 2	letri 11366	. . . 4 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶)
16	3, 2	letri3i 11353	. . . . . 6 ⊢ (𝐴 = 𝐶 ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴))
17	16	biimpri 231	. . . . 5 ⊢ ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐴 = 𝐶)
18	17	eqcomd 2768	. . . 4 ⊢ ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐶 = 𝐴)
19	15, 18	stoic3 1809	. . 3 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐶 = 𝐴)
20	8, 14, 19	3jca 1146	. 2 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → (𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴))
21	3	eqlei 11347	. . 3 ⊢ (𝐴 = 𝐵 → 𝐴 ≤ 𝐵)
22	1	eqlei 11347	. . 3 ⊢ (𝐵 = 𝐶 → 𝐵 ≤ 𝐶)
23	2	eqlei 11347	. . 3 ⊢ (𝐶 = 𝐴 → 𝐶 ≤ 𝐴)
24	21, 22, 23	3anim123i 1169	. 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴) → (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴))
25	20, 24	impbii 212	1 ⊢ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) ↔ (𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   class class class wbr 5107  ℝcr 11126   ≤ cle 11271

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-resscn 11184  ax-pre-lttri 11201  ax-pre-lttrn 11202

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-po 5567  df-so 5568  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276

This theorem is used by: (None)