MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tsrss Structured version   Visualization version   GIF version

Theorem tsrss 18049
Description: Any subset of a totally ordered set is totally ordered. (Contributed by FL, 24-Jan-2010.) (Proof shortened by Mario Carneiro, 21-Nov-2013.)
Assertion
Ref Expression
tsrss (𝑅 ∈ TosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ TosetRel )

Proof of Theorem tsrss
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 psss 18040 . . 3 (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ PosetRel)
2 inss1 4129 . . . . . 6 (𝑅 ∩ (𝐴 × 𝐴)) ⊆ 𝑅
3 dmss 5756 . . . . . 6 ((𝑅 ∩ (𝐴 × 𝐴)) ⊆ 𝑅 → dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ dom 𝑅)
4 ssralv 3953 . . . . . 6 (dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ dom 𝑅 → (∀𝑥 ∈ dom 𝑅𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥) → ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥)))
52, 3, 4mp2b 10 . . . . 5 (∀𝑥 ∈ dom 𝑅𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥) → ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥))
6 ssralv 3953 . . . . . . 7 (dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ dom 𝑅 → (∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥) → ∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦𝑦𝑅𝑥)))
72, 3, 6mp2b 10 . . . . . 6 (∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥) → ∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦𝑦𝑅𝑥))
87ralimi 3073 . . . . 5 (∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥) → ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦𝑦𝑅𝑥))
95, 8syl 17 . . . 4 (∀𝑥 ∈ dom 𝑅𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥) → ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦𝑦𝑅𝑥))
10 inss2 4130 . . . . . . . . . 10 (𝑅 ∩ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴)
11 dmss 5756 . . . . . . . . . 10 ((𝑅 ∩ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) → dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ dom (𝐴 × 𝐴))
1210, 11ax-mp 5 . . . . . . . . 9 dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ dom (𝐴 × 𝐴)
13 dmxpid 5784 . . . . . . . . 9 dom (𝐴 × 𝐴) = 𝐴
1412, 13sseqtri 3923 . . . . . . . 8 dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ 𝐴
1514sseli 3883 . . . . . . 7 (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) → 𝑥𝐴)
1614sseli 3883 . . . . . . 7 (𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) → 𝑦𝐴)
17 brinxp 5612 . . . . . . . 8 ((𝑥𝐴𝑦𝐴) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
18 brinxp 5612 . . . . . . . . 9 ((𝑦𝐴𝑥𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
1918ancoms 462 . . . . . . . 8 ((𝑥𝐴𝑦𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
2017, 19orbi12d 919 . . . . . . 7 ((𝑥𝐴𝑦𝐴) → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
2115, 16, 20syl2an 599 . . . . . 6 ((𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∧ 𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))) → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
2221ralbidva 3107 . . . . 5 (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) → (∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦𝑦𝑅𝑥) ↔ ∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
2322ralbiia 3077 . . . 4 (∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦𝑦𝑅𝑥) ↔ ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
249, 23sylib 221 . . 3 (∀𝑥 ∈ dom 𝑅𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥) → ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
251, 24anim12i 616 . 2 ((𝑅 ∈ PosetRel ∧ ∀𝑥 ∈ dom 𝑅𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥)) → ((𝑅 ∩ (𝐴 × 𝐴)) ∈ PosetRel ∧ ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
26 eqid 2736 . . 3 dom 𝑅 = dom 𝑅
2726istsr2 18044 . 2 (𝑅 ∈ TosetRel ↔ (𝑅 ∈ PosetRel ∧ ∀𝑥 ∈ dom 𝑅𝑦 ∈ dom 𝑅(𝑥𝑅𝑦𝑦𝑅𝑥)))
28 eqid 2736 . . 3 dom (𝑅 ∩ (𝐴 × 𝐴)) = dom (𝑅 ∩ (𝐴 × 𝐴))
2928istsr2 18044 . 2 ((𝑅 ∩ (𝐴 × 𝐴)) ∈ TosetRel ↔ ((𝑅 ∩ (𝐴 × 𝐴)) ∈ PosetRel ∧ ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
3025, 27, 293imtr4i 295 1 (𝑅 ∈ TosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ TosetRel )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  wo 847  wcel 2112  wral 3051  cin 3852  wss 3853   class class class wbr 5039   × cxp 5534  dom cdm 5536  PosetRelcps 18024   TosetRel ctsr 18025
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 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307
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 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-br 5040  df-opab 5102  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ps 18026  df-tsr 18027
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator