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

Theorem trclub 14925
Description: The Cartesian product of the domain and range of a relation is an upper bound for its transitive closure. (Contributed by RP, 17-May-2020.)
Assertion
Ref Expression
trclub ((𝑅𝑉 ∧ Rel 𝑅) → {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ⊆ (dom 𝑅 × ran 𝑅))
Distinct variable group:   𝑅,𝑟
Allowed substitution hint:   𝑉(𝑟)

Proof of Theorem trclub
StepHypRef Expression
1 relssdmrn 6228 . . . 4 (Rel 𝑅𝑅 ⊆ (dom 𝑅 × ran 𝑅))
2 ssequn1 4139 . . . 4 (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
31, 2sylib 218 . . 3 (Rel 𝑅 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
4 trclublem 14922 . . 3 (𝑅𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)})
5 eleq1 2825 . . . 4 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅) → ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ↔ (dom 𝑅 × ran 𝑅) ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)}))
65biimpa 476 . . 3 (((𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅) ∧ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)}) → (dom 𝑅 × ran 𝑅) ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)})
73, 4, 6syl2anr 598 . 2 ((𝑅𝑉 ∧ Rel 𝑅) → (dom 𝑅 × ran 𝑅) ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)})
8 intss1 4919 . 2 ((dom 𝑅 × ran 𝑅) ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} → {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ⊆ (dom 𝑅 × ran 𝑅))
97, 8syl 17 1 ((𝑅𝑉 ∧ Rel 𝑅) → {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ⊆ (dom 𝑅 × ran 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2715  cun 3900  wss 3902   cint 4903   × cxp 5623  dom cdm 5625  ran crn 5626  ccom 5629  Rel wrel 5630
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4904  df-br 5100  df-opab 5162  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator