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

Theorem trclublem 13582
Description: If a relation exists then the class of transitive relations which are supersets of that relation is not empty. (Contributed by RP, 28-Apr-2020.)
Assertion
Ref Expression
trclublem (𝑅𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
Distinct variable group:   𝑥,𝑅
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem trclublem
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 trclexlem 13581 . 2 (𝑅𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V)
2 ssun1 3738 . . 3 𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
3 relcnv 5422 . . . . . . . . . . . . . 14 Rel 𝑅
4 relssdmrn 5573 . . . . . . . . . . . . . 14 (Rel 𝑅𝑅 ⊆ (dom 𝑅 × ran 𝑅))
53, 4ax-mp 5 . . . . . . . . . . . . 13 𝑅 ⊆ (dom 𝑅 × ran 𝑅)
6 ssequn1 3745 . . . . . . . . . . . . 13 (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
75, 6mpbi 219 . . . . . . . . . . . 12 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)
8 cnvun 5457 . . . . . . . . . . . . 13 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (𝑅(dom 𝑅 × ran 𝑅))
9 cnvxp 5470 . . . . . . . . . . . . . . 15 (dom 𝑅 × ran 𝑅) = (ran 𝑅 × dom 𝑅)
10 df-rn 5049 . . . . . . . . . . . . . . . 16 ran 𝑅 = dom 𝑅
11 dfdm4 5238 . . . . . . . . . . . . . . . 16 dom 𝑅 = ran 𝑅
1210, 11xpeq12i 5061 . . . . . . . . . . . . . . 15 (ran 𝑅 × dom 𝑅) = (dom 𝑅 × ran 𝑅)
139, 12eqtri 2632 . . . . . . . . . . . . . 14 (dom 𝑅 × ran 𝑅) = (dom 𝑅 × ran 𝑅)
1413uneq2i 3726 . . . . . . . . . . . . 13 (𝑅(dom 𝑅 × ran 𝑅)) = (𝑅 ∪ (dom 𝑅 × ran 𝑅))
158, 14eqtri 2632 . . . . . . . . . . . 12 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (𝑅 ∪ (dom 𝑅 × ran 𝑅))
167, 15, 133eqtr4i 2642 . . . . . . . . . . 11 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)
1716breqi 4589 . . . . . . . . . 10 (𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑎𝑏(dom 𝑅 × ran 𝑅)𝑎)
18 vex 3176 . . . . . . . . . . 11 𝑏 ∈ V
19 vex 3176 . . . . . . . . . . 11 𝑎 ∈ V
2018, 19brcnv 5227 . . . . . . . . . 10 (𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑎𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏)
2118, 19brcnv 5227 . . . . . . . . . 10 (𝑏(dom 𝑅 × ran 𝑅)𝑎𝑎(dom 𝑅 × ran 𝑅)𝑏)
2217, 20, 213bitr3i 289 . . . . . . . . 9 (𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑎(dom 𝑅 × ran 𝑅)𝑏)
2316breqi 4589 . . . . . . . . . 10 (𝑐(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑐(dom 𝑅 × ran 𝑅)𝑏)
24 vex 3176 . . . . . . . . . . 11 𝑐 ∈ V
2524, 18brcnv 5227 . . . . . . . . . 10 (𝑐(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)
2624, 18brcnv 5227 . . . . . . . . . 10 (𝑐(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐)
2723, 25, 263bitr3i 289 . . . . . . . . 9 (𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐𝑏(dom 𝑅 × ran 𝑅)𝑐)
2822, 27anbi12i 729 . . . . . . . 8 ((𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) ↔ (𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐))
2928biimpi 205 . . . . . . 7 ((𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) → (𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐))
3029eximi 1752 . . . . . 6 (∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) → ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐))
3130ssopab2i 4928 . . . . 5 {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)} ⊆ {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐)}
32 df-co 5047 . . . . 5 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)}
33 df-co 5047 . . . . 5 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) = {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐)}
3431, 32, 333sstr4i 3607 . . . 4 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))
35 xptrrel 13567 . . . . 5 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (dom 𝑅 × ran 𝑅)
36 ssun2 3739 . . . . 5 (dom 𝑅 × ran 𝑅) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
3735, 36sstri 3577 . . . 4 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
3834, 37sstri 3577 . . 3 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
39 trcleq2lem 13578 . . . . 5 (𝑥 = (𝑅 ∪ (dom 𝑅 × ran 𝑅)) → ((𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) ↔ (𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))))
4039elabg 3320 . . . 4 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)} ↔ (𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))))
4140biimprd 237 . . 3 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → ((𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)}))
422, 38, 41mp2ani 710 . 2 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
431, 42syl 17 1 (𝑅𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wex 1695  wcel 1977  {cab 2596  Vcvv 3173  cun 3538  wss 3540   class class class wbr 4583  {copab 4642   × cxp 5036  ccnv 5037  dom cdm 5038  ran crn 5039  ccom 5042  Rel wrel 5043
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050
This theorem is referenced by:  trclubi  13583  trclubiOLD  13584  trclubgi  13585  trclubgiOLD  13586  trclub  13587  trclubg  13588
  Copyright terms: Public domain W3C validator