Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  trrelsuperrel2dg Structured version   Visualization version   GIF version

Theorem trrelsuperrel2dg 41168
Description: Concrete construction of a superclass of relation 𝑅 which is a transitive relation. (Contributed by RP, 20-Jul-2020.)
Hypothesis
Ref Expression
trrelsuperrel2dg.s (𝜑𝑆 = (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
Assertion
Ref Expression
trrelsuperrel2dg (𝜑 → (𝑅𝑆 ∧ (𝑆𝑆) ⊆ 𝑆))

Proof of Theorem trrelsuperrel2dg
StepHypRef Expression
1 ssun1 4102 . . 3 𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
2 trrelsuperrel2dg.s . . 3 (𝜑𝑆 = (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
31, 2sseqtrrid 3970 . 2 (𝜑𝑅𝑆)
4 xptrrel 14619 . . . . 5 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (dom 𝑅 × ran 𝑅)
5 ssun2 4103 . . . . 5 (dom 𝑅 × ran 𝑅) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
64, 5sstri 3926 . . . 4 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
76a1i 11 . . 3 (𝜑 → ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
82, 2coeq12d 5762 . . . 4 (𝜑 → (𝑆𝑆) = ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
9 coundir 6141 . . . . . 6 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = ((𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ∪ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
10 relcnv 6001 . . . . . . 7 Rel 𝑅
11 cocnvcnv1 6150 . . . . . . . . 9 (𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = (𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
12 relssdmrn 6161 . . . . . . . . . . 11 (Rel 𝑅𝑅 ⊆ (dom 𝑅 × ran 𝑅))
13 dmcnvcnv 5831 . . . . . . . . . . . 12 dom 𝑅 = dom 𝑅
14 rncnvcnv 5832 . . . . . . . . . . . 12 ran 𝑅 = ran 𝑅
1513, 14xpeq12i 5608 . . . . . . . . . . 11 (dom 𝑅 × ran 𝑅) = (dom 𝑅 × ran 𝑅)
1612, 15sseqtrdi 3967 . . . . . . . . . 10 (Rel 𝑅𝑅 ⊆ (dom 𝑅 × ran 𝑅))
17 coss1 5753 . . . . . . . . . 10 (𝑅 ⊆ (dom 𝑅 × ran 𝑅) → (𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
1816, 17syl 17 . . . . . . . . 9 (Rel 𝑅 → (𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
1911, 18eqsstrrid 3966 . . . . . . . 8 (Rel 𝑅 → (𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
20 ssequn1 4110 . . . . . . . 8 ((𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ↔ ((𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ∪ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))) = ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
2119, 20sylib 217 . . . . . . 7 (Rel 𝑅 → ((𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ∪ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))) = ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
2210, 21ax-mp 5 . . . . . 6 ((𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ∪ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))) = ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
239, 22eqtri 2766 . . . . 5 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
24 coundi 6140 . . . . . 6 ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = (((dom 𝑅 × ran 𝑅) ∘ 𝑅) ∪ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
25 cocnvcnv2 6151 . . . . . . . . 9 ((dom 𝑅 × ran 𝑅) ∘ 𝑅) = ((dom 𝑅 × ran 𝑅) ∘ 𝑅)
26 coss2 5754 . . . . . . . . . 10 (𝑅 ⊆ (dom 𝑅 × ran 𝑅) → ((dom 𝑅 × ran 𝑅) ∘ 𝑅) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
2716, 26syl 17 . . . . . . . . 9 (Rel 𝑅 → ((dom 𝑅 × ran 𝑅) ∘ 𝑅) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
2825, 27eqsstrrid 3966 . . . . . . . 8 (Rel 𝑅 → ((dom 𝑅 × ran 𝑅) ∘ 𝑅) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
29 ssequn1 4110 . . . . . . . 8 (((dom 𝑅 × ran 𝑅) ∘ 𝑅) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ↔ (((dom 𝑅 × ran 𝑅) ∘ 𝑅) ∪ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
3028, 29sylib 217 . . . . . . 7 (Rel 𝑅 → (((dom 𝑅 × ran 𝑅) ∘ 𝑅) ∪ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
3110, 30ax-mp 5 . . . . . 6 (((dom 𝑅 × ran 𝑅) ∘ 𝑅) ∪ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))
3224, 31eqtri 2766 . . . . 5 ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))
3323, 32eqtri 2766 . . . 4 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))
348, 33eqtrdi 2795 . . 3 (𝜑 → (𝑆𝑆) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
357, 34, 23sstr4d 3964 . 2 (𝜑 → (𝑆𝑆) ⊆ 𝑆)
363, 35jca 511 1 (𝜑 → (𝑅𝑆 ∧ (𝑆𝑆) ⊆ 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  cun 3881  wss 3883   × cxp 5578  ccnv 5579  dom cdm 5580  ran crn 5581  ccom 5584  Rel wrel 5585
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator