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

Theorem trclublem 14706
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 14705 . 2 (𝑅𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V)
2 ssun1 4106 . . 3 𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
3 relcnv 6012 . . . . . . . . . . . . . 14 Rel 𝑅
4 relssdmrn 6172 . . . . . . . . . . . . . 14 (Rel 𝑅𝑅 ⊆ (dom 𝑅 × ran 𝑅))
53, 4ax-mp 5 . . . . . . . . . . . . 13 𝑅 ⊆ (dom 𝑅 × ran 𝑅)
6 ssequn1 4114 . . . . . . . . . . . . 13 (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
75, 6mpbi 229 . . . . . . . . . . . 12 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)
8 cnvun 6046 . . . . . . . . . . . . 13 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (𝑅(dom 𝑅 × ran 𝑅))
9 cnvxp 6060 . . . . . . . . . . . . . . 15 (dom 𝑅 × ran 𝑅) = (ran 𝑅 × dom 𝑅)
10 df-rn 5600 . . . . . . . . . . . . . . . 16 ran 𝑅 = dom 𝑅
11 dfdm4 5804 . . . . . . . . . . . . . . . 16 dom 𝑅 = ran 𝑅
1210, 11xpeq12i 5617 . . . . . . . . . . . . . . 15 (ran 𝑅 × dom 𝑅) = (dom 𝑅 × ran 𝑅)
139, 12eqtri 2766 . . . . . . . . . . . . . 14 (dom 𝑅 × ran 𝑅) = (dom 𝑅 × ran 𝑅)
1413uneq2i 4094 . . . . . . . . . . . . 13 (𝑅(dom 𝑅 × ran 𝑅)) = (𝑅 ∪ (dom 𝑅 × ran 𝑅))
158, 14eqtri 2766 . . . . . . . . . . . 12 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (𝑅 ∪ (dom 𝑅 × ran 𝑅))
167, 15, 133eqtr4i 2776 . . . . . . . . . . 11 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)
1716breqi 5080 . . . . . . . . . 10 (𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑎𝑏(dom 𝑅 × ran 𝑅)𝑎)
18 vex 3436 . . . . . . . . . . 11 𝑏 ∈ V
19 vex 3436 . . . . . . . . . . 11 𝑎 ∈ V
2018, 19brcnv 5791 . . . . . . . . . 10 (𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑎𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏)
2118, 19brcnv 5791 . . . . . . . . . 10 (𝑏(dom 𝑅 × ran 𝑅)𝑎𝑎(dom 𝑅 × ran 𝑅)𝑏)
2217, 20, 213bitr3i 301 . . . . . . . . 9 (𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑎(dom 𝑅 × ran 𝑅)𝑏)
2316breqi 5080 . . . . . . . . . 10 (𝑐(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑐(dom 𝑅 × ran 𝑅)𝑏)
24 vex 3436 . . . . . . . . . . 11 𝑐 ∈ V
2524, 18brcnv 5791 . . . . . . . . . 10 (𝑐(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)
2624, 18brcnv 5791 . . . . . . . . . 10 (𝑐(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐)
2723, 25, 263bitr3i 301 . . . . . . . . 9 (𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐𝑏(dom 𝑅 × ran 𝑅)𝑐)
2822, 27anbi12i 627 . . . . . . . 8 ((𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) ↔ (𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐))
2928biimpi 215 . . . . . . 7 ((𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) → (𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐))
3029eximi 1837 . . . . . 6 (∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) → ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐))
3130ssopab2i 5463 . . . . 5 {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)} ⊆ {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐)}
32 df-co 5598 . . . . 5 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)}
33 df-co 5598 . . . . 5 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) = {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏𝑏(dom 𝑅 × ran 𝑅)𝑐)}
3431, 32, 333sstr4i 3964 . . . 4 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))
35 xptrrel 14691 . . . . 5 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (dom 𝑅 × ran 𝑅)
36 ssun2 4107 . . . . 5 (dom 𝑅 × ran 𝑅) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
3735, 36sstri 3930 . . . 4 ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
3834, 37sstri 3930 . . 3 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
39 trcleq2lem 14702 . . . . 5 (𝑥 = (𝑅 ∪ (dom 𝑅 × ran 𝑅)) → ((𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) ↔ (𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))))
4039elabg 3607 . . . 4 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)} ↔ (𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))))
4140biimprd 247 . . 3 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → ((𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)}))
422, 38, 41mp2ani 695 . 2 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
431, 42syl 17 1 (𝑅𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1539  wex 1782  wcel 2106  {cab 2715  Vcvv 3432  cun 3885  wss 3887   class class class wbr 5074  {copab 5136   × cxp 5587  ccnv 5588  dom cdm 5589  ran crn 5590  ccom 5593  Rel wrel 5594
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601
This theorem is referenced by:  trclubi  14707  trclubgi  14708  trclub  14709  trclubg  14710
  Copyright terms: Public domain W3C validator