ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  le2tri3i GIF version

Theorem le2tri3i 8436
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
StepHypRef Expression
1 lt.2 . . . . . 6 𝐵 ∈ ℝ
2 lt.3 . . . . . 6 𝐶 ∈ ℝ
3 lt.1 . . . . . 6 𝐴 ∈ ℝ
41, 2, 3letri 8435 . . . . 5 ((𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐵 ≤ 𝐴)
53, 1letri3i 8426 . . . . . 6 (𝐴 = 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴))
65biimpri 133 . . . . 5 ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴) → 𝐴 = 𝐵)
74, 6sylan2 286 . . . 4 ((𝐴 ≤ 𝐵 ∧ (𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴)) → 𝐴 = 𝐵)
873impb 1230 . . 3 ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐴 = 𝐵)
92, 3, 1letri 8435 . . . . . 6 ((𝐶 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵) → 𝐶 ≤ 𝐵)
101, 2letri3i 8426 . . . . . . 7 (𝐵 = 𝐶 ↔ (𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))
1110biimpri 133 . . . . . 6 ((𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) → 𝐵 = 𝐶)
129, 11sylan2 286 . . . . 5 ((𝐵 ≤ 𝐶 ∧ (𝐶 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵)) → 𝐵 = 𝐶)
13123impb 1230 . . . 4 ((𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵) → 𝐵 = 𝐶)
14133comr 1242 . . 3 ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐵 = 𝐶)
153, 1, 2letri 8435 . . . . 5 ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶)
163, 2letri3i 8426 . . . . . . 7 (𝐴 = 𝐶 ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴))
1716biimpri 133 . . . . . 6 ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐴 = 𝐶)
1817eqcomd 2244 . . . . 5 ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐶 = 𝐴)
1915, 18sylan 283 . . . 4 (((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) ∧ 𝐶 ≤ 𝐴) → 𝐶 = 𝐴)
20193impa 1225 . . 3 ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → 𝐶 = 𝐴)
218, 14, 203jca 1208 . 2 ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) → (𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴))
223eqlei 8421 . . 3 (𝐴 = 𝐵 → 𝐴 ≤ 𝐵)
231eqlei 8421 . . 3 (𝐵 = 𝐶 → 𝐵 ≤ 𝐶)
242eqlei 8421 . . 3 (𝐶 = 𝐴 → 𝐶 ≤ 𝐴)
2522, 23, 243anim123i 1215 . 2 ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴) → (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴))
2621, 25impbii 126 1 ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ∧ 𝐶 ≤ 𝐴) ↔ (𝐴 = 𝐵 ∧ 𝐵 = 𝐶 ∧ 𝐶 = 𝐴))
Colors of variables:    wff set class
This proof depends on syntax axioms:   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209   class class class wbr 4130  ℝcr 8179   ≤ cle 8362
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-apti 8295
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-xp 4780  df-cnv 4782  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator