Theorem trleile 30968

Description: In a Toset, two elements must compare. (Contributed by Thierry Arnoux, 12-Sep-2018.)

Hypotheses

Ref	Expression
trleile.b	⊢ 𝐵 = (Base‘𝐾)
trleile.l	⊢ ≤ = ((le‘𝐾) ∩ (𝐵 × 𝐵))

Assertion

Ref	Expression
trleile	⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ∨ 𝑌 ≤ 𝑋))

Proof of Theorem trleile

Step	Hyp	Ref	Expression
1		trleile.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		eqid 2737	. . . 4 ⊢ (le‘𝐾) = (le‘𝐾)
3	1, 2	tleile 17927	. . 3 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(le‘𝐾)𝑌 ∨ 𝑌(le‘𝐾)𝑋))
4		3simpc 1152	. . . . . 6 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))
5		brxp 5598	. . . . . 6 ⊢ (𝑋(𝐵 × 𝐵)𝑌 ↔ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))
6	4, 5	sylibr 237	. . . . 5 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋(𝐵 × 𝐵)𝑌)
7		brin 5105	. . . . . 6 ⊢ (𝑋((le‘𝐾) ∩ (𝐵 × 𝐵))𝑌 ↔ (𝑋(le‘𝐾)𝑌 ∧ 𝑋(𝐵 × 𝐵)𝑌))
8	7	rbaib 542	. . . . 5 ⊢ (𝑋(𝐵 × 𝐵)𝑌 → (𝑋((le‘𝐾) ∩ (𝐵 × 𝐵))𝑌 ↔ 𝑋(le‘𝐾)𝑌))
9	6, 8	syl 17	. . . 4 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋((le‘𝐾) ∩ (𝐵 × 𝐵))𝑌 ↔ 𝑋(le‘𝐾)𝑌))
10	4	ancomd 465	. . . . . 6 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵))
11		brxp 5598	. . . . . 6 ⊢ (𝑌(𝐵 × 𝐵)𝑋 ↔ (𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵))
12	10, 11	sylibr 237	. . . . 5 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌(𝐵 × 𝐵)𝑋)
13		brin 5105	. . . . . 6 ⊢ (𝑌((le‘𝐾) ∩ (𝐵 × 𝐵))𝑋 ↔ (𝑌(le‘𝐾)𝑋 ∧ 𝑌(𝐵 × 𝐵)𝑋))
14	13	rbaib 542	. . . . 5 ⊢ (𝑌(𝐵 × 𝐵)𝑋 → (𝑌((le‘𝐾) ∩ (𝐵 × 𝐵))𝑋 ↔ 𝑌(le‘𝐾)𝑋))
15	12, 14	syl 17	. . . 4 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌((le‘𝐾) ∩ (𝐵 × 𝐵))𝑋 ↔ 𝑌(le‘𝐾)𝑋))
16	9, 15	orbi12d 919	. . 3 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋((le‘𝐾) ∩ (𝐵 × 𝐵))𝑌 ∨ 𝑌((le‘𝐾) ∩ (𝐵 × 𝐵))𝑋) ↔ (𝑋(le‘𝐾)𝑌 ∨ 𝑌(le‘𝐾)𝑋)))
17	3, 16	mpbird 260	. 2 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋((le‘𝐾) ∩ (𝐵 × 𝐵))𝑌 ∨ 𝑌((le‘𝐾) ∩ (𝐵 × 𝐵))𝑋))
18		trleile.l	. . . 4 ⊢ ≤ = ((le‘𝐾) ∩ (𝐵 × 𝐵))
19	18	breqi 5059	. . 3 ⊢ (𝑋 ≤ 𝑌 ↔ 𝑋((le‘𝐾) ∩ (𝐵 × 𝐵))𝑌)
20	18	breqi 5059	. . 3 ⊢ (𝑌 ≤ 𝑋 ↔ 𝑌((le‘𝐾) ∩ (𝐵 × 𝐵))𝑋)
21	19, 20	orbi12i 915	. 2 ⊢ ((𝑋 ≤ 𝑌 ∨ 𝑌 ≤ 𝑋) ↔ (𝑋((le‘𝐾) ∩ (𝐵 × 𝐵))𝑌 ∨ 𝑌((le‘𝐾) ∩ (𝐵 × 𝐵))𝑋))
22	17, 21	sylibr 237	1 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ∨ 𝑌 ≤ 𝑋))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∨ wo 847   ∧ w3a 1089   = wceq 1543   ∈ wcel 2110   ∩ cin 3865   class class class wbr 5053   × cxp 5549  ‘cfv 6380  Basecbs 16760  lecple 16809  Tosetctos 17922

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pr 5322

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-sbc 3695  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-br 5054  df-opab 5116  df-xp 5557  df-iota 6338  df-fv 6388  df-toset 17923

This theorem is referenced by:  ordtrest2NEWlem  31586  ordtconnlem1  31588