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

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

Proof of Theorem trclubg
StepHypRef Expression
1 trclublem 13728 . 2 (𝑅𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)})
2 intss1 4490 . 2 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} → {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
31, 2syl 17 1 (𝑅𝑉 {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  wcel 1989  {cab 2607  cun 3570  wss 3572   cint 4473   × cxp 5110  dom cdm 5112  ran crn 5113  ccom 5116
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1721  ax-4 1736  ax-5 1838  ax-6 1887  ax-7 1934  ax-8 1991  ax-9 1998  ax-10 2018  ax-11 2033  ax-12 2046  ax-13 2245  ax-ext 2601  ax-sep 4779  ax-nul 4787  ax-pow 4841  ax-pr 4904  ax-un 6946
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1485  df-ex 1704  df-nf 1709  df-sb 1880  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2752  df-ne 2794  df-ral 2916  df-rex 2917  df-rab 2920  df-v 3200  df-dif 3575  df-un 3577  df-in 3579  df-ss 3586  df-nul 3914  df-if 4085  df-pw 4158  df-sn 4176  df-pr 4178  df-op 4182  df-uni 4435  df-int 4474  df-br 4652  df-opab 4711  df-xp 5118  df-rel 5119  df-cnv 5120  df-co 5121  df-dm 5122  df-rn 5123  df-res 5124
This theorem is referenced by:  trclfv  13735  trclfvub  13742  dmtrcl  37760  rntrcl  37761
  Copyright terms: Public domain W3C validator