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

Theorem trclublem 14346
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 14345 . 2 (𝑅𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V)
2 ssun1 4099 . . 3 𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
3 relcnv 5934 . . . . . . . . . . . . . 14 Rel 𝑅
4 relssdmrn 6088 . . . . . . . . . . . . . 14 (Rel 𝑅𝑅 ⊆ (dom 𝑅 × ran 𝑅))
53, 4ax-mp 5 . . . . . . . . . . . . 13 𝑅 ⊆ (dom 𝑅 × ran 𝑅)
6 ssequn1 4107 . . . . . . . . . . . . 13 (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
75, 6mpbi 233 . . . . . . . . . . . 12 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)
8 cnvun 5968 . . . . . . . . . . . . 13 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (𝑅(dom 𝑅 × ran 𝑅))
9 cnvxp 5981 . . . . . . . . . . . . . . 15 (dom 𝑅 × ran 𝑅) = (ran 𝑅 × dom 𝑅)
10 df-rn 5530 . . . . . . . . . . . . . . . 16 ran 𝑅 = dom 𝑅
11 dfdm4 5728 . . . . . . . . . . . . . . . 16 dom 𝑅 = ran 𝑅
1210, 11xpeq12i 5547 . . . . . . . . . . . . . . 15 (ran 𝑅 × dom 𝑅) = (dom 𝑅 × ran 𝑅)
139, 12eqtri 2821 . . . . . . . . . . . . . 14 (dom 𝑅 × ran 𝑅) = (dom 𝑅 × ran 𝑅)
1413uneq2i 4087 . . . . . . . . . . . . 13 (𝑅(dom 𝑅 × ran 𝑅)) = (𝑅 ∪ (dom 𝑅 × ran 𝑅))
158, 14eqtri 2821 . . . . . . . . . . . 12 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (𝑅 ∪ (dom 𝑅 × ran 𝑅))
167, 15, 133eqtr4i 2831 . . . . . . . . . . 11 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)
1716breqi 5036 . . . . . . . . . 10 (𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑎𝑏(dom 𝑅 × ran 𝑅)𝑎)
18 vex 3444 . . . . . . . . . . 11 𝑏 ∈ V
19 vex 3444 . . . . . . . . . . 11 𝑎 ∈ V
2018, 19brcnv 5717 . . . . . . . . . 10 (𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑎𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏)
2118, 19brcnv 5717 . . . . . . . . . 10 (𝑏(dom 𝑅 × ran 𝑅)𝑎𝑎(dom 𝑅 × ran 𝑅)𝑏)
2217, 20, 213bitr3i 304 . . . . . . . . 9 (𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑎(dom 𝑅 × ran 𝑅)𝑏)
2316breqi 5036 . . . . . . . . . 10 (𝑐(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑐(dom 𝑅 × ran 𝑅)𝑏)
24 vex 3444 . . . . . . . . . . 11 𝑐 ∈ V
2524, 18brcnv 5717 . . . . . . . . . 10 (𝑐(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)
2624, 18brcnv 5717 . . . . . . . . . 10 (𝑐(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐)
2723, 25, 263bitr3i 304 . . . . . . . . 9 (𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐𝑏(dom 𝑅 × ran 𝑅)𝑐)
2822, 27anbi12i 629 . . . . . . . 8 ((𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) ↔ (𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐))
2928biimpi 219 . . . . . . 7 ((𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) → (𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐))
3029eximi 1836 . . . . . 6 (∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) → ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐))
3130ssopab2i 5402 . . . . 5 {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)} ⊆ {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐)}
32 df-co 5528 . . . . 5 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)}
33 df-co 5528 . . . . 5 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) = {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐)}
3431, 32, 333sstr4i 3958 . . . 4 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))
35 xptrrel 14331 . . . . 5 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (dom 𝑅 × ran 𝑅)
36 ssun2 4100 . . . . 5 (dom 𝑅 × ran 𝑅) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
3735, 36sstri 3924 . . . 4 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
3834, 37sstri 3924 . . 3 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
39 trcleq2lem 14342 . . . . 5 (𝑥 = (𝑅 ∪ (dom 𝑅 × ran 𝑅)) → ((𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) ↔ (𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))))
4039elabg 3614 . . . 4 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)} ↔ (𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))))
4140biimprd 251 . . 3 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → ((𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)}))
422, 38, 41mp2ani 697 . 2 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
431, 42syl 17 1 (𝑅𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wex 1781  wcel 2111  {cab 2776  Vcvv 3441  cun 3879  wss 3881   class class class wbr 5030  {copab 5092   × cxp 5517  ccnv 5518  dom cdm 5519  ran crn 5520  ccom 5523  Rel wrel 5524
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531
This theorem is referenced by:  trclubi  14347  trclubgi  14348  trclub  14349  trclubg  14350
  Copyright terms: Public domain W3C validator